Tip 1: Prepare each topic on DSA, do at least 20 medium-level questions, and for topics like DP and graphs, do 50 questions.
Tip 2: Don't ignore personal projects; make 2 good projects.
Tip 3: Prepare core subjects towards the end of your preparation.
Tip 4: Participate in contests on coding platforms; it helps in solving problems in a time-bound environment.
Tip 1 : Mention two good projects
Tip 2 : Mention any good rankings in coding competitions
1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.
Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order.
2) All the elements of the array are pairwise distinct.
In the below map of Ninjaland let say you want to go from S=1 to T=8, the shortest path is (1, 3, 8). You can also go from S=1 to T=8 via (1, 2, 5, 8) or (1, 4, 6, 7, 8) but these paths are not shortest.
Input: 's' = "pqqr"
Output: 5
Explanation: The subsequences are:
p
q
q
r
qq
Please note that both "q" are considered different.
‘?’ – matches any single character
‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
Where do you see yourself in 5 years?
Biggest failure/success.
What new technical skills have you picked up in the last 12 months?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is 3 + 2 * 4 based on operator precedence?