Tip 1 : Practice well
Tip 2 : Participate in coding competitions
Tip 1 : Keep it short and crisp
Tip 2 : Highlight your projects and programming languages
30 MCQ questions of medium-hard difficulty and 1 coding problem



A = “bc”, B = “abcddbc”.
String “A” is present at index 1, and 5(0-based index), but we will return 1 as it is the first occurrence of “A” in string “B”.
Can you solve this in linear time and space complexity?
you can do it with brute-force approach which has complexity of O(n2). But I used sliding window with complexity of O(n)
One coding question was asked and much probing was done by the interviewer



For the given binary tree:

The Inorder traversal will be [5, 3, 2, 1, 7, 4, 6].

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: