Skip to content
Related Articles
Open in App
Not now

Related Articles

Odessa Interview Experience for Software Intern

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 05 Mar, 2021
Improve Article
Save Article

Online Round: 40 MCQs and 2 Medium to hard coding questions

Result: Solved around 35 MCQs. I did both coding questions. Passed all 5 test cases in the first question and 3 test cases in the second question.

Technical Interview 1: I would like to divide the whole interview process into 4 parts.


  • Introduction and experience (if any)
  • Introduction by the interviewer and by me.
  • She asked me about my experience as an intern.

Data structure and algorithm:

  1. She asked should we start with DSA and if yes, rate yourself on DSA.
  2. Asked what are data structures you are familiar with.
  3. I answered Array, stack, queue, tree, and graph.

She asked few questions on array stack and queue. The Questions were.

  1. Implementation of the queue using stack – Answered with pseudocode and basic approach and time complexity.
  2. Asked about the time complexity of few operations in the array, stack, and queue.
  3. Then she asked about the real-time applications of data structures. I chose array, stack, and tree to answer this.
  4. Further, she asked about where we use the stack or applications of the stack to be specific.
  5. She gave a program of reversing the first k elements of the queue- I answered with an algorithm of using the stack as auxiliary space to reverse the k elements and a code on paper and showed.

Then she moved onto a linked list and tree. Questions were

  1. What is a doubly-linked list?
  2. What is Binary Search Tree
  3. What will Inorder traversal of BST give?
  4. How will you find the minimum element of BST— answered with pseudocode and an example.
  5. Write code for converting sorted doubly linked list to balanced BST.
  6. Then she asked few questions on the algorithm.
  7. She asked me to code bubble sort.
  8. Asked about the approach and time complexity as well.

OOPs: Rate yourself on OOPs concepts. Questions.

  1. Abstraction and an example
  2. Static and const variable difference


  1. What DB you use.
  2. Asked about the keys in the database.

In the end, she asked any questions for us. I asked about the quick feedback.

Technical Interview 2: The interviewer was a senior product manager.

  1. He asked me to introduce myself.
  2. Then he asked few questions on OOPs.
  3. Abstraction Encapsulation. Their real-life applications asked me to explain how we use them in building software.
  4. Then we had a general discussion on some more OOPs concepts like aggregation and composition.
  5. Then he moved on to Operating systems.
  6. He asked about threads, multithreading OS, problems with multithreading OS.
  7. Race condition and how can we solve it.

PS: I didn’t revise OS concepts before the interview. But I could just explain what I knew about it. Not in much detail but the definition and few examples, will work in the case where your other parts of the interview go well enough to compensate for this part.


  1. He asked me the approach to find the middle element. Then I told 2 approaches for this.
  2. He cross-questioned over a number of elements being odd or even. How will I handle these cases?
  3. He asked me to find the sum of two numbers represented in the form of a linked list.
  4. He asked to code the above problem. He changed few cases in between and asked me to code accordingly.
  5. A medium-level question on arrays.


  1. Behavioral scenarios. Problems — how will I approach them. Basically checking problem-solving Skills.
  2. Some company-related real-world problems were focusing on how do I approach them.
  3. Talked about projects.
  4. Challenges and experience of the last Internship.
  5. A bit about myself. What thing am I interested in apart from academics.

Result: Selected.

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!