Tip 1 : Practice enough medium and hard-level questions from online platforms
Tip 2 : Work on your CS fundamentals really well.
Tip 3 : Prepare your projects thoroughly.
Tip 1 : If you have DSA/CP achievements do mention them.
Tip 2 : Mention at least 2 good projects in your resume.
It was a problem-solving round taken by a third-party interviewing company named Karat.
The same letter cell should not be used more than once.
For a given word “design” and the given 2D board
[[q’, ‘v’, ‘m’, ‘h’],
[‘d’, ‘e’, ‘s’, ‘i’],
[‘d’, ‘g’, ‘f’, ‘g’],
[‘e’, ‘c’, ‘p’, ‘n’]]
The word design can be formed by sequentially adjacent cells as shown by the highlighted color in the 2nd row and last column.
This was a straightforward DFS problem solved by maintaining a visited set.
Take two pointers pointing to the first and the last node respectively. Traverse the linked list using both pointers in the alternate direction and swap the links of the nodes at each step.
It was a Problem Solving Round (DSA based)
Input: 'n' = 3, 'm' = 4
'queries' = [[1, 1], [1, 2], [2, 3]]
Output: [1, 1, 2]
Explanation:
Initially, the grid was:
0 0 0 0
0 0 0 0
0 0 0 0
After query (1, 1):
0 0 0 0
0 1 0 0
0 0 0 0
There is one island having land (1, 1).
After query (1, 2):
0 0 0 0
0 1 1 0
0 0 0 0
Since (1, 1) and (1, 2) share a common edge, they form one island. So there is one island having lands (1, 1) and (1, 2).
After query (2, 3):
0 0 0 0
0 1 1 0
0 0 0 1
Now there are two islands, one having lands (1, 1) and (1, 2), and another having land (2, 3).
So the number of islands after each query is [1, 1, 2].
DFS using visited set.
This round mainly revolved around Project and CS fundamentals and System design.
Pros and cons of indexing in a database.
Tip 1 : Prepare CS fundamentals.
Tip 2 : Prepare short notes on each topic.
Tip 1 : Read about caching and its implementation
Database design and SQL queries of Quora-based platform.
Tip 1 : Practice ER diagram.
Tip 2 : Practice SQL queries.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?