Tip 1 : Be prepare with your Core Computer Science Projects
Tip 2 : Having good Programming technical Skills
Tip 1 : Be confident at What u have mentioned in your resume
Tip 2 : Try to make one page resume
This Round consists of questions from both technical and non-technical part



Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]
Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]
Explanation: The array is sorted in increasing order.
Solved it using DNF approach



Input: Let the binary tree be:

Output: YES
Explanation: As we can see in the image, the original tree is the same as the mirrored tree.
Based on the symmetric definition, we can use the following rules to check whether two binary trees are a symmetric
Majorly Questions asked by interview from your resume what you have mentioned in it.
Having Good knowledge of at least one programming language if you are applying for software engineer position.



Write a code to find frequency of duplicate elements from an array.
My approach was simply run a loop in O(n) complexity and check each elements appears twice or not



Write psuedo code to reverse a linked list
Tip 1 : Traverse the linked list from both end and starting
Tip 2 : Swap nodes at every step
This round was quite easy and finally I got offer by HCL technologies
Tip 1 : Stay Confident
Tip 2 : Be honest
Tip 3 : Show a positive attitude.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?