Tip 1: Familiarize yourself with basic data structure concepts like arrays, linked lists, stacks, queues, and trees.
Tip 2: Learn about their properties, operations, and time complexities.
Tip 3: Attend mock interviews and develop good communication skills.
Tip 1: Maintain at least two different projects and write a powerful summary statement.
Tip 2: Highlight skills relevant to the job description and include relevant experience.
Throughout the technical interview, the emphasis was not only on finding the correct solutions but also on the ability to communicate effectively, explain our thought processes, and justify design choices. The interviewers assessed our problem-solving skills, analytical thinking, and overall grasp of DSA and DBMS concepts.
As the answer can be very large, return the answer by taking modulo with 1000000007.
If ‘N’=1
So in 1 step we can reach either to ‘X’ , ‘Y’ or ‘Z’ and can not travel back to ‘O’.
Thus there are 0 ways.
If ‘N’ =2
So there are total three ways :
(i) O->X->O
(ii) O->Y->O
(iii) O->Z->O
If ‘N’ = 3
So there are total 6 ways :
(i) O->X->Y->O
(ii) O->X->Z->O
(iii) O->Y->X->O
(iv) O->Y->Z->O
(v) O->Z->X->O
(vi) O->Z->Y->O
Input: Consider the binary tree A as shown in the figure:
Output: [10, 5, 3, 7, 18, 25, 20]
Explanation: As shown in the figure
The nodes on the left boundary are [10, 5, 3]
The nodes on the right boundary are [10, 20, 25]
The leaf nodes are [3, 7, 18, 25].
Please note that nodes 3 and 25 appear in two places but are considered once.
Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Tell me about yourself.
Why should I hire you?
What are your strengths and weaknesses?
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?