i
Odessa
Filter interviews by
Use Floyd's Cycle Detection Algorithm to detect loop in a Linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a loop in the linked list.
To find the middle of a linked list, use the slow and fast pointer technique.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.
The position of the slow pointer will be the middle of the linked list.
I was interviewed in Mar 2024.
20 questions in Aptitude and 20 questions in coding
Short coding round containing 4 questions
They are asked for machine learning as the topic filtered 15 out of 30 peoples
They shared some topic related to current affairs
Real-time examples of OOP concepts include inheritance in vehicle classes, encapsulation in banking systems, and polymorphism in shape classes.
Inheritance: Car and Bike classes inheriting from Vehicle class
Encapsulation: BankAccount class with private variables and public methods
Polymorphism: Circle and Square classes both inheriting from Shape class
I applied via Campus Placement
Basic aptitude questions involved basic mathematics,reasoning and English.
It was quite simple but Little bit tricky.
There were physical round of coding they give one coding question and give 20 min. to solve that question
I applied via Walk-in and was interviewed before Oct 2023. There were 2 interview rounds.
The first round is a online test
1 question is given to solve , easy one
Odessa interview questions for designations
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Oct 2022. There were 2 interview rounds.
The coding test consisted of two programming questions hosted on a platform
I applied via Campus Placement and was interviewed before Sep 2022. There were 3 interview rounds.
Aptitude Test is not so much hard and no so much simple. It is of medium difficulty and Includes vast variety of Questions,
In Coding they ask 3 Questions along with 30 MCQ related to Engineer topics. Coding question is from Simple -> Hard
I applied via campus placement at Lovely Professional University (LPU) and was interviewed before Sep 2021. There were 5 interview rounds.
1 hours, Easy to medium Level Questions
2 hours, easy Level Question on tree, Arrays and Binary Search
I applied via Naukri.com and was interviewed in Nov 2020. There were 6 interview rounds.
Top trending discussions
Implement tree traversal algorithm to visit each node in a tree structure
Use depth-first search (DFS) or breadth-first search (BFS) to traverse the tree
DFS can be implemented using recursion or a stack data structure
BFS can be implemented using a queue data structure
Example: Inorder traversal of a binary tree - left, root, right
Find the path in a matrix with the longest sum of elements
Start from the top-left corner of the matrix
Move only right or down in the matrix
Keep track of the sum of elements in each path
Return the path with the longest sum
based on 8 interviews
3 Interview rounds
based on 38 reviews
Rating in categories
Business Analyst
293
salaries
| ₹8.2 L/yr - ₹15.2 L/yr |
Senior Software Engineer
220
salaries
| ₹5 L/yr - ₹18 L/yr |
Software Engineer
219
salaries
| ₹4 L/yr - ₹10.5 L/yr |
Senior Business Analyst
133
salaries
| ₹10 L/yr - ₹23.1 L/yr |
Associate Business Analyst
108
salaries
| ₹8 L/yr - ₹11 L/yr |
Nucleus Software Exports
Newgen Software Technologies
TCS
Infosys