Filter interviews by
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
Quant , logical reasoning and programming mcq
There was 2 coding question on hackerrank
I appeared for an interview before Aug 2016.
I applied via Walk-in and was interviewed in Mar 2021. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
I am a dedicated and experienced consultant with a strong background in problem-solving and client management.
Over 5 years of experience in consulting roles
Skilled in analyzing data and providing strategic recommendations
Proven track record of successfully managing client relationships
Strong communication and presentation skills
Certified in relevant consulting methodologies
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 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.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
Question from Array,DP
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
based on 1 interview
Interview experience
Trainer
3
salaries
| ₹1.2 L/yr - ₹1.8 L/yr |
Junior Accountant
3
salaries
| ₹2 L/yr - ₹2 L/yr |
Back Office Coordinator
3
salaries
| ₹1.5 L/yr - ₹1.6 L/yr |
Technical Trainer
3
salaries
| ₹2.2 L/yr - ₹6.3 L/yr |
Service Design Engineer
3
salaries
| ₹3 L/yr - ₹3.5 L/yr |
Marpu Foundation
Huawei Technologies
HCL Infosystems
Z X Learning