i
AmbitionBox
Filter interviews by
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
Divide the input array into two halves
Recursively sort the two halves
Merge the sorted halves back together
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
Choose a pivot element from the array.
Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
Recursively apply the same process to the sub-arrays.
Combine the sorted sub-arrays to get the final sorted array.
I applied via Naukri.com and was interviewed in Jun 2022. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in May 2022. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2021. There was 1 interview round.
Polymorphism is the ability of an object to take on many forms.
Polymorphism allows objects to be treated as if they are of multiple types.
It enables code to be written that can work with objects of different classes in a uniform way.
Polymorphism can be achieved through method overloading or method overriding.
Example: A shape class can have multiple subclasses like circle, square, triangle, etc. and all can be treated a...
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows for code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class, and can also add new properties and method...
AmbitionBox interview questions for designations
What people are saying about AmbitionBox
posted on 27 Jan 2017
I appeared for an interview in Dec 2016.
I applied via LinkedIn and was interviewed before Jan 2024. There were 3 interview rounds.
Aptitude test was simple.
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
3 Coding question medium level
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
NEED TO QUALIFY IN THIS TEST
NEED TO QUALIFY THIS TEST ALSO
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
50 questions in 12 minutes mostly test your arthimetic, logical knowledge.
3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.
Sorting algorithms are methods used to arrange elements in a specific order.
Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.
For example, quick sort is generally faster than bubble sort for large data sets.
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
based on 1 interview
Interview experience
Software Engineer
17
salaries
| ₹6 L/yr - ₹24 L/yr |
Operations Executive
11
salaries
| ₹2 L/yr - ₹4.2 L/yr |
Senior Software Engineer
8
salaries
| ₹20 L/yr - ₹38 L/yr |
Executive
6
salaries
| ₹2.8 L/yr - ₹3.3 L/yr |
Senior Executive
6
salaries
| ₹2.8 L/yr - ₹4.5 L/yr |
Cogoport
KrazyBee
Treebo Hotels
Woodenstreet.com