2. Do not remember second question but it was on binary tree.
Group-fly round :
Remove repeating charaters from a given string in O(1) space and O(n) time , where n is the length
of the given string.
F2F Interview 1 :
The interviewer firest disccused about my projects , specially my data mining project.
Then he asked me to write standard edit distace code and then to optimize it in terms of space, I did it in O(2*n) instead of O(n*m).
Aecond question was this : https://www.geeksforgeeks.org/majority-element/
F2F Interview 2:
2. Question on linked list and involved swapping of nodes, do not remember the exact question.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Related Practice Problems
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer DSA Live Classes