Skip to content
Related Articles

Related Articles

Improve Article

Undostres Interview September 2018

  • Last Updated : 14 Sep, 2018


Undostres Questions September 2018

Round 1: Written coding and MCQ round of 1 hr 30 min. 20 MCQ’s and 3 coding problems on Data structures.
MCQ’s had the question on following topics:

  • Sorting Algo
  • Time complexities
  • DP
  • Greedy Algo
  • Binary Trees
  • Heap
  • Output problems

3 coding questions were:

  • You are given a singly linked list and you have to print all pair of nodes in the linked list whose sum is 10. If no pair exists print -1
    Solution
  • You are given an array of integers. You have to find the two elements from the array whose absolute difference is minimum. If multiple pairs of elements exist print them all.
    Solution
  • You are given a binary tree, find all pair of nodes whose sum is equal to 20

Only function was asked to be implemented not the whole program.

Round 2: Students shortlisted after round 1 were called for Technical Round on Skype. Problems asked in this round were tough Data structures problem


Study DSA and time, space complexities.
Be confident and clear in your answers. If you are having a Skype interview, make sure you have the good Internet connection so that you can understand the problem and the interviewer can clearly hear you.

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 are prepared, test your skills using TCS, Wipro, AmazonGoogle and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :