Filter interviews by
posted on 20 Apr 2023
I applied via Approached by Company and was interviewed in Oct 2022. There were 3 interview rounds.
I applied via LinkedIn and was interviewed in Dec 2021. There were 3 interview rounds.
Concentricity, cylindricity, run-out, total run-out, and parallelism can be checked using various tools and techniques.
Concentricity can be checked using a dial indicator or a coordinate measuring machine (CMM).
Cylindricity can be checked using a roundness tester or a CMM.
Run-out can be checked using a dial indicator or a run-out gauge.
Total run-out can be checked using a run-out gauge or a CMM.
Parallelism can be check...
I applied via Company Website and was interviewed in Dec 2020. There was 1 interview round.
Online education system in India has great potential but needs improvement.
Online education has become more popular due to the pandemic.
There is a lack of infrastructure and resources for online education in rural areas.
Online education can be more affordable and accessible than traditional education.
There is a need for better quality control and accreditation for online courses.
Online education can provide opportuniti...
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
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 before Oct 2022. There were 3 interview rounds.
50 questions in 12mins
posted on 16 Aug 2024
I applied via LinkedIn and was interviewed before Aug 2023. There was 1 interview round.
DSA-keep practicing multithreading questions
I was interviewed before Sep 2022.
I have cleared the first test
I applied via Walk-in and was interviewed in Mar 2023. There were 3 interview rounds.
In aptitude test, team will ask you questions which will based on mathematical reasoning, genral knowledge, family relation and so on.
You can prepare yourself from Google or YouTube also.
All the best.
They will give you one topic and you have to put your point of view
Some of the top questions asked at the Twenty Two Motors interview -
based on 5 interviews
Interview experience
based on 31 reviews
Rating in categories
Quality Executive
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Cogoport
Arzooo.com
Treebo Hotels
KrazyBee