Upload Button Icon Add office photos

Filter interviews by

Amit Motors Interview Questions and Answers

Be the first one to contribute and help others!

Interview questions from similar companies

Interview Preparation Tips

Round: TECHNICAL ROUND TEST
Experience: A 45 mins round which consisted of 30 mins of core questions and 15 mins of data structures.  It was a mix of test on our knowledge .

Round: HR Interview
Experience: Most of the questions were based on general knowledge and many of them were from the resume provides by me

General Tips: It is always advisable to be prepared with certain set of general questions which make it easier to answer.
Skill Tips: Focus on your Study.. Revise the subject that you have studied at the time of Interview
Skills: Technical Skills
College Name: IIT MADRAS

Interview Preparation Tips

Round: Test
Experience: Questions were on Aptitude, English, Probability, Permutations andCombinations and Programming (C, C++). NO Group Discussion was held.Candidates were shortlisted on the basis of their test scores.

Round: Technical Interview
Experience: Total time of this round was 45 minutes.First 30 minutes, questions on core programming were asked and in the remaining 15 minutes questions were asked on data structures.

Round: HR Interview
Experience: This was a 5 minute round where questions were put up, some based on the resume and other were general questions.

Skills: Knowledge in MATLAB.
College Name: IIT MADRAS

I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Were do you see yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Good the hiring process is fine but idk anything further

I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Check if binary tree is balanced or not.
  • Ans. 

    Check if binary tree is balanced or not.

    • A balanced binary tree has the height of left and right subtrees differ by at most 1.

    • Recursively check the height of left and right subtrees and compare.

    • Use a helper function to calculate the height of a subtree.

    • Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.

  • Answered by AI
  • Q2. Detect loops in linked list.
  • Ans. 

    Detect loops in a linked list.

    • Use two pointers, one moving at a faster pace than the other.

    • If there is a loop, the faster pointer will eventually catch up to the slower one.

    • To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview experience was good, do your DS Algo questoin thoroughly.

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Oct 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Everything in your resume questions from your domain and 1 quizzes

Interview Preparation Tips

Interview preparation tips for other job seekers - Completely prepare your resume

Interview Questionnaire 

2 Questions

  • Q1. Write Query
  • Ans. 

    Write a query

    • Specify the database and table name

    • List the columns to be selected

    • Add any conditions or filters

    • Specify the order of results

  • Answered by AI
  • Q2. Update query

Skills evaluated in this interview

Interview Questionnaire 

4 Questions

  • Q1. About your self
  • Q2. About java
  • Q3. Phython
  • Q4. Project details

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong ont losse ur hope

Interview Questionnaire 

1 Question

  • Q1. Why Cognizant ?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and learn the requirements
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

The aptitutde test was entirely based on your logical reasoning and aptitude handling skills.

Round 3 - HR 

(1 Question)

  • Q1. The Hr asked some 6-7 logical and aptitude-based questions. Firstly she started with tell me something about yourself. It was 1.5 hr long interview.

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep calm

I was interviewed in Sep 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

3 coding question + 50 dsa

  • Q1. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q2. 

    Height of a Binary Tree

    You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.

    Explana...

  • Ans. 

    Calculate the height of a binary tree given its level order traversal.

    • Traverse the binary tree level by level and keep track of the height as you go down the tree.

    • Use a queue data structure to perform level order traversal efficiently.

    • The height of a binary tree is the maximum number of edges from the root to any leaf node.

    • Handle NULL nodes represented by -1 in the input.

    • Return the height of the binary tree as a single

  • Answered by AI
  • Q3. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and count the number of connected components.

    • Maintain a visited array to keep track of visited cells to avoid counting the same island multiple times.

    • Iterate through each cell in the matrix and if it is a land (1) and not visited, perform DFS/BFS to explore the connected land cells.

    • I...

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

2 coding questions

  • Q1. 

    Maximum Length Pair Chain Problem Statement

    You are given 'N' pairs of integers where the first number is always smaller than the second number, i.e., in pair (a, b) -> a < b always. A pair chain is...

  • Ans. 

    Find the length of the longest pair chain that can be formed using the given pairs.

    • Sort the pairs based on the second element in ascending order.

    • Iterate through the sorted pairs and keep track of the maximum chain length.

    • Update the chain length if the current pair can be added to the chain.

    • Return the maximum chain length at the end.

  • Answered by AI
  • Q2. 

    Maximize Stock Trading Profit

    You are given an array prices, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i...

  • Ans. 

    Find maximum profit by buying and selling stocks multiple times.

    • Iterate through the array and find all increasing sequences of stock prices.

    • Calculate profit by buying at the start and selling at the end of each increasing sequence.

    • Sum up all profits to get the maximum profit achievable.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Data structures,java script,web dev related questions,dbms questions

  • Q1. Can you describe how to design a web crawler?
  • Ans. 

    Designing a web crawler involves defining the scope, selecting a crawling strategy, implementing the crawler, handling data storage, and ensuring politeness.

    • Define the scope of the web crawler by determining the websites to crawl and the depth of the crawl.

    • Select a crawling strategy such as breadth-first or depth-first search based on the requirements.

    • Implement the web crawler using a programming language like Python o...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteria7 cgpaJosh Technology Group interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 3 : practice basics of dsa

Application resume tips for other job seekers

Tip 1 : show your projects
Tip 2 : highlight your skills

Final outcome of the interviewRejected

Skills evaluated in this interview

Tell us how to improve this page.

Amit Motors Reviews and Ratings

based on 17 reviews

4.7/5

Rating in categories

4.5

Skill development

4.6

Work-life balance

4.4

Salary

4.4

Job security

4.6

Company culture

4.2

Promotions

4.6

Work satisfaction

Explore 17 Reviews and Ratings
Accountant
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

General Manager
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Service Manager
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Executive
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Manager
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Amit Motors with

Coca-Cola Company

4.1
Compare

Dhoot Transmission

3.7
Compare

Genius Consultants

3.8
Compare

Apotex Research

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview