Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by OLX Team. If you also belong to the team, you can get access from here

OLX Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

OLX Inspection Engineer Interview Questions and Answers

Updated 30 Jan 2022

OLX Inspection Engineer Interview Experiences

1 interview found

I applied via Approached by company and was interviewed before Jan 2021. There were 4 interview rounds.

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 - HR 

(2 Questions)

  • Q1. Share details of your previous job.
  • Q2. Tell me about yourself.
Round 3 - Technical 

(1 Question)

  • Q1. Detailed inspection for car ,and documentation and leagual knowledge.
Round 4 - HR 

(1 Question)

  • Q1. What are your salary expectations?

Interview Preparation Tips

Interview preparation tips for other job seekers - Need to knkw well about car and government documents knowledge.

Interview questions from similar companies

Round 1 - Technical 

(1 Question)

  • Q1. What is actual rule is using to sale more products in this company
  • Ans. 

    The actual rule for selling more products in this company is to focus on customer needs and provide excellent customer service.

    • Focus on customer needs and preferences

    • Provide excellent customer service

    • Offer promotions and discounts

    • Maintain high product quality

    • Stay up-to-date with market trends

    • Build strong relationships with customers

    • Encourage customer feedback and use it to improve

    • Train sales staff to be knowledgeable a

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing is hard work may take bow in life
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is AI ?
  • Ans. 

    AI stands for Artificial Intelligence, which is the simulation of human intelligence processes by machines, especially computer systems.

    • AI involves the development of algorithms that can perform tasks that typically require human intelligence.

    • Examples of AI include speech recognition, image recognition, natural language processing, and autonomous vehicles.

    • AI can be categorized into narrow AI (focused on a specific task...

  • Answered by AI
  • Q2. Tell me about machine learning
  • Ans. 

    Machine learning is a branch of artificial intelligence that involves developing algorithms and models that can learn from and make predictions or decisions based on data.

    • Machine learning uses algorithms to analyze data, learn from it, and make predictions or decisions.

    • It is used in various fields such as healthcare, finance, marketing, and more.

    • Examples of machine learning applications include recommendation systems, ...

  • Answered by AI

Skills evaluated in this interview

Software Developer Interview Questions & Answers

Snapdeal user image Adithya H K Upadhya

posted on 3 Dec 2015

Interview Preparation Tips

Round: Test
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.

Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).

General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

1 Question

  • Q1. Questions based on tree

Interview Preparation Tips

Round: Test
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30

Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax

Skills: Thinking Process
College Name: IIT GUWHATI

Interview Questionnaire 

7 Questions

  • Q1. Discussion on internship at IBM' Cloud Unit
  • Q2. Find LCM of all numbers from 1 to n. Give an algorithm, then correctly estimate the time complexity
  • Ans. 

    Algorithm to find LCM of all numbers from 1 to n and its time complexity

    • Find prime factors of all numbers from 1 to n

    • For each prime factor, find the highest power it appears in any number from 1 to n

    • Multiply all prime factors raised to their highest power to get LCM

    • Time complexity: O(n*log(log(n)))

  • Answered by AI
  • Q3. SQL vs NoSQL. Why NoSQL
  • Ans. 

    NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.

    • NoSQL databases are schema-less, allowing for easy and flexible data modeling.

    • They can handle large amounts of unstructured data, making them suitable for big data applications.

    • NoSQL databases are highly scalable and can easily handle high traffic and large user bases.

    • They provide horizontal scalability by distributing data across...

  • Answered by AI
  • Q4. Some DBMS designing question relating to Snapdeal website
  • Q5. JAVA-Spring and Hibernate
  • Q6. Variation of -----/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n
  • Ans. 

    The question asks to find the count of words in a dictionary that can be formed by a given number.

    • Iterate through each word in the dictionary

    • Check if the characters in the word can be formed using the given number

    • Increment the count if the word can be formed

  • Answered by AI
  • Q7. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H...

Interview Preparation Tips

Round: Test
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23

Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles

Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.

Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree

Round: HR Interview
Experience: Typical HR

General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -

Skills evaluated in this interview

Interview Questionnaire 

16 Questions

  • Q1. Lowest Common Ancestor of two nodes in binary tree.I wrote code for this.Then interviewer drew a tree and asked to print stacktrace on it
  • Ans. 

    Finding lowest common ancestor of two nodes in binary tree

    • Traverse the tree from root to both nodes and store the paths in separate arrays

    • Compare the paths to find the last common node

    • Return the last common node as the lowest common ancestor

    • Use recursion to traverse the tree efficiently

  • Answered by AI
  • Q2. You are given two ropes.Each rope takes exactly 1 hour to burn. How will you measure period of 45 minutes
  • Q3. Singleton Design pattern
  • Q4. Two linked list are merging at a point.Find merging point
  • Ans. 

    To find the merging point of two linked lists

    • Traverse both linked lists and find their lengths

    • Move the pointer of the longer list by the difference in lengths

    • Traverse both lists simultaneously until they meet at the merging point

  • Answered by AI
  • Q5. Reverse linked list without recursion
  • Ans. 

    Reverse a linked list iteratively

    • Create three pointers: prev, curr, and next

    • Initialize prev to null and curr to head

    • Loop through the list and set next to curr's next node

    • Set curr's next node to prev

    • Move prev and curr one step forward

    • Return prev as the new head

  • Answered by AI
  • Q6. Number of rectangles in MxN matrix
  • Ans. 

    The number of rectangles in an MxN matrix can be calculated using a formula.

    • The formula is (M * (M + 1) * N * (N + 1)) / 4

    • The matrix can be divided into smaller sub-matrices to count the rectangles

    • The number of rectangles can also be calculated by counting all possible pairs of rows and columns

  • Answered by AI
  • Q7. All anagrams of a string.He called it anagram but i think he wanted to ask all possible substrings of a string
  • Q8. Which Design patterns you have used.I said Decorator,Factory,Singleton.Then he asked about Decorator design pattern
  • Q9. Tell me about yourself.Then by looking at my resume he said you don’t have hands on experience in Java as i was working in php.I said though i don’t have hands on experience but i am good in programming an...
  • Q10. There is four digit number in aabb form and it is a perfect square.Find out the number
  • Ans. 

    The number is 7744.

    • The number must end in 00 or 44.

    • The square root of the number must be a whole number.

    • The only possible number is 7744.

  • Answered by AI
  • Q11. You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,...
  • Q12. Same tell me about yourself
  • Ans. 

    I am a software developer with experience in multiple programming languages and a passion for problem-solving.

    • Proficient in Java, Python, and C++

    • Experience with web development using HTML, CSS, and JavaScript

    • Familiarity with agile development methodologies

    • Strong problem-solving and analytical skills

    • Passionate about learning new technologies and staying up-to-date with industry trends

  • Answered by AI
  • Q13. There is a file which contains ip addresses and corresponding url. Example 192.168.1.15 www.abc.com 10.255.255.40 ----- You have to return the subnet mask of the ip and the url after “www.” Output 192.1...
  • Ans. 

    Java function to return subnet mask of IP and URL after www.

    • Read the file and store IP addresses and URLs in separate arrays

    • Use regex to extract subnet mask from IP address

    • Use substring to extract URL after www.

    • Return subnet mask and URL as separate strings

  • Answered by AI
  • Q14. 3 mislabeled jar puzzle.Since i had heard this puzzle many times,i answered it in 2-3 minutes.He said i can make out that you have heard this puzzle already ;)
  • Q15. What are inner join and outer join in sql
  • Ans. 

    Inner join returns only the matching rows between two tables, while outer join returns all rows from one table and matching rows from the other.

    • Inner join combines rows from two tables based on a matching column.

    • Outer join returns all rows from one table and matching rows from the other.

    • Left outer join returns all rows from the left table and matching rows from the right table.

    • Right outer join returns all rows from the...

  • Answered by AI
  • Q16. A linked list contains loop.Find the length of non looped linked list
  • Ans. 

    To find the length of non-looped linked list, we need to traverse the list and count the number of nodes.

    • Traverse the linked list using a pointer and count the number of nodes until the end of the list is reached.

    • If a loop is encountered, break out of the loop and continue counting until the end of the list.

    • Return the count as the length of the non-looped linked list.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: 3.You have a deck of 10 cards.You take one card out and put it on table and put next card in the end of deck.You repeat this sequence till all cards are on the table.Sequence formed on the table is 1,2,3,4,5…10. What was the original sequence of card.After doing some exercise i answered 1,6,2,10,3,7,4,9,5,8.Then he asked me to write a function for this which takes a number and return the array.

Skills: Algorithm, Java, OOP, data structure
College Name: NA

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Online Test-21 (MCQ) +2 (Coding) in 1 hr. Test conducted on hackerrank21 MCQ had almost 10 aptitude and 11 C output based questions.



Give preference to coding questions. Try to solve both questions ( Pass all test cases for one of the questions and do attempt the other question ( even brute force would pass many test cases )



Aptitude can’t be solved just within a minute. Solve C o/p based questions first.Questions-



1. Overlapping paintings, find no. of paintings that can be seen distinctly, extreme co-ordinates of paintings are given. Ordering of paintings matter. ( Assume heights of all paintings are same, start and end coordinates are given )E.g.



5
1 4
2 6
3 4
8 10
7 10


XXXX
XXXXXX
XX
XXX <- This painting is hidden completely
XXXX Simple O(N^2) solution. Starting from rightmost painting, check if it completely hides any painting or not based on start and end coordinates. ( modification of interval selection problem )2- Given points of two lines segments A(x1,y1 x2,y2) & B(x3,y3 x4,y4) find whether the 2 segments intersect or not.



Simpler approach ( short code )-



-----?module=Static&d1=tutorials&d2=geometry2#line_line_intersectionLength / complicated soln-



----- cut-off -



I solved 2nd question and passed 1 test case for first question ( misunderstood the question during online round !! :p ) and solved 4 MCQ's only ( all fluke )



So my advice, do solve both coding questions for sure and solve C o/p questions in last 15 min
Duration: 60 minutes

Round: Technical Interview
Experience: Avg 20-30 mins. 22 shortlisted



My went on for 1 hr to 1hr 15 minsInternship based dicussion (20-30 mins ). Based on Cloud, Virtualization, Networking



Q1- Given N, find LCM from of all numbers from 2 to N. Give the complexity expressed in the form of Number of prime numbers <= N. Had to be really precise in terms of complexity ( in terms of prime factors, maximum recurrences, each recurrence complexity ). Long dicussion on complexity. Don't say any method whose complexity you cannot prove. (E.g saying that i can use Sieve of Eratosthenes for prime pre-processing will lead to question of complexity of Sieve which is O( Log LogN), that cannot be proved trivally. ) So avoid using any such termsQ3- Spring / Hibernate in JAVA



Told him i work in C/C++ only. No experience in JAVAQ2- Types of SQL- NoSQL and SQL(Relational DBMS ). Why the need of NoSQL- Big Data AnalyticsQ3- How would you design DBMS for Snapdeal's website's shoe section.



Now if you want to further break it into Sports and Casual Shoe would you break the DB into two or add another entity ? Full justificdation



I initially answered with a multi-level indexed structure for DBMS storage. Could not answer on the second part of the question. He asked if i knew DBMS and i told him I do not know DBMS. He skipped the question and ended the interview. Told him i had advanced DBMS lab in my course currenlty and would learn it before graduating.

Round: Puzzle Interview
Experience: Q1- -----/



Q2- -----/



Q3- ----- was the first one to solve all 3 in 45 mins roughly and went for next interview. Shortlisting criteria- 2 questions in 1 hr – 1hr 15 mins even though they said that we had 2 hrs to solve all 3 questions !!

Round: Technical Interview
Experience: 4 shortlisted. This round went for almost 1hr 45 min - 2 hrs for me since I solved the Round 2 question earliest. Other 3 had almost 45 mins interview.Q1- Variation of



-----/



Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n.



I started by exponential solution and reduced it to polynomial. We discussed various approaches and tried a variety of methods and after 1-1.5 hrs of discussion finally ended up with an O(1) solution with some pre-processing overhead. After achiveing O(1) time complexity, he asked to further optimize the space complexity.



Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.Q2- Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H ( not necessarily consecutive ) elements of array equal with minimum cost.E.g.



N=6, H=4



2 3 5 6 4 4changes to -> 4 4 5 6 4 4



Cost is ( 4-2 + 4-3 = 3 )N=6, H=3



2 3 5 6 4 4changes to -> 2 4 5 6 4 4



Cost is ( 4-3 = 1 )



Optimal complexity- O(N)

Round: HR Interview
Experience: 3 shortlistedTypical HR round.I would like to thank geeksforgeeks for a exhaustive set of interview questions and study material on data structures-algorithms.

College Name: NA

Interview Questionnaire 

10 Questions

  • Q1. What do you do when your schedule is interrupted? How you handle it?
  • Q2. PreOrder traversal without recursion?
  • Ans. 

    PreOrder traversal without recursion is done using a stack to simulate the function call stack.

    • Create an empty stack and push the root node onto it.

    • While the stack is not empty, pop a node from the stack and process it.

    • Push the right child of the popped node onto the stack if it exists.

    • Push the left child of the popped node onto the stack if it exists.

  • Answered by AI
  • Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
  • Ans. 

    Yes

    • Create an empty binary search tree (BST)

    • Loop over the unsorted array

    • For each element, insert it into the BST using the appropriate insertion logic

    • Repeat until all elements are inserted

    • The resulting BST will be built from the unsorted array

  • Answered by AI
  • Q4. Find 2 elements in array whose sum is equal to given number?
  • Ans. 

    The question asks to find two elements in an array whose sum is equal to a given number.

    • Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

    • Use a hash set to store the elements as you iterate through the array for efficient lookup.

    • Return the pair of elements if found, otherwise return a message indicating no such pair exists.

  • Answered by AI
  • Q5. How many types of trigger?
  • Ans. 

    There are two types of triggers: DML triggers and DDL triggers.

    • DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.

    • DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.

    • Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt

  • Answered by AI
  • Q6. Can trigger be used with select statement?
  • Ans. 

    Yes, triggers can be used with select statements in SQL.

    • Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.

    • While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.

    • Using triggers with select statements allows you to perform additional actions or validations before or af...

  • Answered by AI
  • Q7. Indexing in mysql? How many types of indexing in mysql?
  • Ans. 

    Indexing in MySQL improves query performance. There are several types of indexing in MySQL.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.

    • B-tree indexes are the most common and suitable for most use cases.

    • Hash indexes are used for exact match lookups.

    • Full-text indexes are used for searching text-based data efficie...

  • Answered by AI
  • Q8. Engines in mysql?
  • Ans. 

    Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.

    • MySQL supports multiple storage engines, each with its own strengths and features.

    • Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.

    • InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.

    • MyISAM is known for its simplicity and speed but lacks transaction suppo...

  • Answered by AI
  • Q9. Singlton pattern?
  • Q10. Can a constructor be private?
  • Ans. 

    Yes, a constructor can be private.

    • A private constructor can only be accessed within the class itself.

    • It is often used in singleton design pattern to restrict object creation.

    • Private constructors are also useful for utility classes that only contain static methods.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: It was a test of speed as well as accuracy. There were very basic questions of maths and aptitude. Anyone with some practice could clear the test.
Duration: 12 minutes
Total Questions: 50

Round: Test
Experience: The second round was a test of your coding ability, again basic C++ questions, which could be solved easily with some practice of competitive coding.
Tips: Do practice coding on online platforms(hacker-rank, co-cubes, etc) before, as the test was held on these platforms only.

Round: interview 1
Experience: Most of the puzzles asked were of standard type, that can be practiced by following any standard text book or any site.
Tips: Keep discussing puzzles among your group, that would benefit you and the group at the same time.

Round: interview 2
Experience: It was a test of my approach to any question rather than the exact solution. It was kind of a very interactive session rather than a formal one. They asked questions related to the courses that I had undergone and not anything from some other planet.
Tips: Feel free to ask the interviewer for some hints or if your approach is correct or not.

General Tips: Be confident and just try to tackle every problem in a very organised manner (as you would have practiced before in your group or during practice).
Skill Tips: You need to have a strong grip on DS and Algo as this is the most important aspect that they wanted any student to have.
Skills: Data structures, Parallel computing, algorithms
College Name: IIT GUWHATI

OLX Interview FAQs

How many rounds are there in OLX Inspection Engineer interview?
OLX interview process usually has 4 rounds. The most common rounds in the OLX interview process are HR, Resume Shortlist and Technical.
How to prepare for OLX Inspection Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at OLX. The most common topics and skills that interviewers at OLX expect are Customer Handling, Service Industry, Depreciation, Inspection and Product Engineering.

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
Info Edge Interview Questions
3.9
 • 316 Interviews
Lenskart Interview Questions
3.2
 • 304 Interviews
Myntra Interview Questions
4.0
 • 214 Interviews
Uber Interview Questions
4.2
 • 149 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
View all
OLX Inspection Engineer Salary
based on 47 salaries
₹2.8 L/yr - ₹5.1 L/yr
24% less than the average Inspection Engineer Salary in India
View more details

OLX Inspection Engineer Reviews and Ratings

based on 13 reviews

3.6/5

Rating in categories

3.4

Skill development

2.7

Work-life balance

3.5

Salary

2.8

Job security

3.4

Company culture

3.1

Promotions

3.1

Work satisfaction

Explore 13 Reviews and Ratings
Dealer Success Manager
152 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Key Account Manager
141 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Accounts Manager
119 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Accounts Manager
70 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Retail Associate
65 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare OLX with

Quikr

3.7
Compare

eBay

3.8
Compare

Tokopedia

4.0
Compare

Flipkart

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