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 Content Moderator Interview Questions and Answers

Updated 25 May 2024

OLX Content Moderator Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Other 

(1 Question)

  • Q1. Asked about my experience and worked at first

Interview Preparation Tips

Interview preparation tips for other job seekers - Nice job

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Amazon.jobs and was interviewed before Jul 2022. There were 2 interview rounds.

Round 1 - English test 

(1 Question)

  • Q1. We need to draft emails and answers the english questions like errors finding or fill in the blanks sort of
Round 2 - One-on-one 

(2 Questions)

  • Q1. I was asked scenario questions as to how would i react or take actions in that situation
  • Q2. Some sentences were given which had errors hence i need to point out and give the correct form

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident , be yourself don't be anxious and moreover if required take some time think about the question then answer.

I applied via Amazon and was interviewed before Feb 2021. There were 3 interview rounds.

Round 1 - Assignment 

Voice versant and other basic grammar questions

Round 2 - Group Discussion 

They will give a topic and you have to speak about it

Round 3 - One-on-one 

(1 Question)

  • Q1. Basic questions about my self experiences and projects challenges faced by me and other stuff

Interview Preparation Tips

Interview preparation tips for other job seekers - It was an easy recruitment process just keep concentrating
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Company Website

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 - One-on-one 

(5 Questions)

  • Q1. What is name, and hobbies how many years of experience
  • Ans. 

    My name is [Your Name] and I have been a Content Moderator for [X] years. My hobbies include [hobby 1], [hobby 2], and [hobby 3].

    • Name: [Your Name]

    • Years of experience: [X]

    • Hobbies: [hobby 1], [hobby 2], [hobby 3]

  • Answered by AI
  • Q2. What role and responsibilities
  • Ans. 

    A content moderator is responsible for reviewing and monitoring user-generated content to ensure it meets the platform's guidelines and policies.

    • Review and moderate user-generated content

    • Ensure content complies with platform guidelines and policies

    • Identify and remove inappropriate or offensive content

    • Flag and report content that violates policies

    • Provide feedback and guidance to users regarding content standards

    • Stay upd...

  • Answered by AI
  • Q3. And what's is expected package from last CTC
  • Ans. 

    The expected package from my last CTC was around $50,000 per annum.

    • My last CTC was $45,000 per annum

    • I am expecting a hike of around 10%

    • So, the expected package from my last CTC is around $50,000 per annum

  • Answered by AI
  • Q4. What is favourite item food
  • Ans. 

    My favourite food item is pizza.

    • I love the combination of cheese, tomato sauce, and toppings on a crispy crust.

    • I enjoy trying different toppings like pepperoni, mushrooms, and olives.

    • Pizza is a versatile food that can be eaten for any meal of the day.

    • I also like to make my own pizza at home with fresh ingredients.

  • Answered by AI
  • Q5. Self introduction

Interview Preparation Tips

Interview preparation tips for other job seekers - Flow below tips roles responsible l what is role and responsibilities
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Strength and weakness
  • Q2. Future aim of career
  • Ans. 

    To become a senior content moderator and eventually transition into a leadership role within the company.

    • Continue developing expertise in content moderation techniques and tools

    • Seek opportunities for leadership training and development

    • Consistently deliver high-quality moderation results to demonstrate readiness for advancement

  • Answered by AI

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Two coding questions were given in the first round to be solved in 60 minutes.

  • Q1. 

    Rearrange Array Elements Problem Statement

    Given an array A containing 'N' integers and an integer m, rearrange the elements of the array such that the differences between the array elements and m are sor...

  • Ans. 

    Rearrange array elements based on their differences from a given integer.

    • Calculate the differences between each element and the given integer.

    • Sort the elements based on their differences while maintaining the original order for elements with the same difference.

    • Implement a function to rearrange the array elements as per the given criteria.

  • Answered by AI
  • Q2. 

    Print Nodes at Distance K from a Given Node

    Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...

  • Ans. 

    The task is to find all nodes in a binary tree that are at a distance K from a given node.

    • Traverse the binary tree to find the given node

    • From the given node, perform a depth-first search to find all nodes at distance K

    • Use a list to store the values of the nodes at distance K

    • Return the list of values in any order

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.

  • Q1. 

    Triangle of Numbers Pattern

    Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.

    Example:

    Input:
    N = 4
    Output:
       1
    232
    34545
    4567654

    Explanation:

    The pat...

  • Ans. 

    Print a triangle pattern of numbers based on a given number 'N'.

    • Iterate through each row and print the numbers accordingly

    • Use spaces to center-align the numbers in each row

    • Increment the numbers in each row as per the pattern

  • Answered by AI
  • Q2. What is the difference between a web server and an application server?
  • Ans. 

    Web server serves static content over HTTP, while application server runs dynamic content and business logic.

    • Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.

    • Application server executes business logic, runs dynamic content, and interacts with databases.

    • Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.

    • Web server focuses on...

  • Answered by AI
  • Q3. How does the internet work?
  • Ans. 

    The internet is a global network of interconnected computers that communicate using standardized protocols.

    • The internet is made up of a vast number of interconnected networks of computers.

    • Data is transmitted over the internet using protocols such as TCP/IP.

    • Websites are hosted on servers connected to the internet, and users access them using web browsers.

    • Internet Service Providers (ISPs) provide access to the internet f...

  • Answered by AI
  • Q4. Write a SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the 'SELECT DISTINCT' statement to get unique salary values

    • Order the salaries in descending order using 'ORDER BY' clause

    • Use 'LIMIT' and 'OFFSET' to get the nth highest salary

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Chitkara University. Eligibility criteriaAbove 7 CGPAInfo Edge India (Naukri.com) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Given a Linked list , print yes if it is palindrome else print no
  • Q2. Print the level order traversal of the binary tree in the spiral form
  • Ans. 

    Print the level order traversal of binary tree in spiral form

    • Perform level order traversal of the binary tree

    • Alternate the direction of traversal for each level

    • Use a stack to reverse the order of nodes in each level

    • Print the nodes in the order of traversal

  • Answered by AI
  • Q3. Maximum of all subarrays of size k(Expected Time Complexity O(N). Input : arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} k = 3 Output : 3 3 4 5 5 5 6
  • Ans. 

    Find the maximum element in each subarray of size k in a given array.

    • Iterate through the array from index 0 to n-k.

    • For each subarray of size k, find the maximum element.

    • Store the maximum elements in a separate array.

    • Return the array of maximum elements.

  • Answered by AI
  • Q4. Given Two sorted array of size size n each. Find the Kth largest element in these two array (Expected Time Complexity Log(n))
  • Ans. 

    To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

    • Merge the two arrays into a single sorted array using a modified merge sort algorithm.

    • Return the Kth element from the merged array.

  • Answered by AI
  • Q5. Website having several web-pages. And also there are lot many user who are accessing the web-site. say user 1 has access pattern : x->y->z->a->b->c->d->e->f user 2 has access pattern : z->a->b->c->d user 3...
  • Q6. Given two array , one of size m+n and contains m element and other position are empty , 2nd array is of size n and contains n element. both array are sorted , now merge the second array to first one such t...
  • Ans. 

    Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

    • Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

    • Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

    • Continue this process until all elements from the second array are merged into the first array.

  • Answered by AI

Interview Preparation Tips

Round: Test
Duration: 90 minutes

Skills: Algorithm , OS, DBMS, data structure
College Name: NIT BHOPAL

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Coding questions were comparatively easy. There were three questions.1. Given a string map each character of which to the corresponding digit in a 10 digit mobile phone keypad.2. Don't remember, will add when it comes to my mind.3. Don't remember, will add when it comes to my mind.

Skills: Coding ability, Complete knowledge of working of internet.,
College Name: IIT Bombay

Interview Preparation Tips

Round: Test
Experience: Just 1 online test



Round - I (90 mins)



Online Test conducted @ HackerRank



a. M.C.Qs (Operating System + Aptitude + C Programming Language + Object Oriented Programming)



b. Programming (2 coding questions)The Online Exam started off after a brief Presentation on Amazon.





The MCQs were largely based on Operating System, Data structures and Algorithms, OOP concepts, C language and Aptitude.



Coding Questions



1. Determine whether a Linked List is a palindrome or not.



2. Given few sets of intervals print out the the entire intervals without overlapping , if they overlap then combine them into one.



Eg: Input : (5,7) (1 , 6) (2 ,4) (10 ,14) (8,9)



Output : (1,7) (8,9) (10,14)



Advice: Must solve at least 1 coding question to have a good chance for selection into the next round
Tips: CGPA holds importance because it is basic eligibility criteria for written test and then secondly it increases odds in your favor of your selection more than those with lower CGPA with same interview performance. Prepare a good resume



1. Prioritize your content



2. Put the most important information first (Academic Projects + Internship)



3. Proofread it twice



Advice : Do your best and leave the rest to god

Round: Test
Experience: Round II

2 Coding questions

1. Classic 2-sum problem

2. Given numbers a, b as the seeds for the Fibonacci sequence determine if a third number 'k' is a part of that sequence or not. (Tricky)
Total Questions: 2

Round: Other Interview
Experience: Round III
1. Tell me about yourself
2. Project + Internship Discussion
3. Compress a given string "aabbbccc" to "a2b3c3"
constraint: inplace compression, no extra space to be used
assumption : output size will not exceed input size

Round: Technical Interview
Experience: Round IV
1. Internship Project Discussion (30 mins)
2. Find the largest count of 0s in a row in a matrix of 0s and 1s sorted in an ascending order row-wise.
3. Replicate a tree with random pointers inplace

Round: Other Interview
Experience: Round V
1. Question related to graphs involving concepts of Depth and Height of a tree. (Took a lot of time in solving it ! but finally recognized the pattern)
2. Maximum size square sub-matrix with all 1s
3. Find the median of an infinite series of integers
4. Find the most popular Google searches. (solved it using Trie and Max-Heaps)
2 more questions but can't remember them.Finally after waiting for more than 9 hours the results were announced and I was selected
Tips: Be cool and always ask the interviewer questions at the end of the interview. Explain the interviewer your progress while solving the question so that you both are on the same page + its easier for him to understand. Behavioral and H.R.
Tips
1. Speak clearly and with confidence
2. Always prepare yourself beforehand for some common questions like:
a. Tell me about yourself.
b. Why should I hire you?
c. What are your strengths and weaknesses? (give examples)
d. What is your Dream Company?

General Tips: They judge you purely on the basis of your knowledge and performance during the face to face interviews. The extra curricular activities are not given much consideration as Amazon focuses its recruitment procedure purely on the basis of your Technical Knowledge. Prepare a good resume
1. Prioritize your content
2. Put the most important information first (Academic Projects + Internship)
3. Proofread it twice
College Name: NIT JAIPUR

Interview Questionnaire 

8 Questions

  • Q1. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity
  • Ans. 

    The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.

    • Traverse the n-ary tree using a depth-first search (DFS) algorithm

    • Keep track of the count of 'B' occurrences

    • When the count reaches 3, return the current position

    • If the end of the tree is reached before the 3rd 'B', return -1

  • Answered by AI
  • Q2. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary
  • Ans. 

    Check if a given string is a composite of two words from a limited dictionary.

    • Create a hash set of all the words in the dictionary.

    • Iterate through all possible pairs of substrings in the given string.

    • Check if both substrings are present in the hash set.

    • If yes, return true. Else, return false.

  • Answered by AI
  • Q3. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3
  • Ans. 

    Switch adjacent nodes in a single linked list.

    • Traverse the linked list and swap adjacent nodes.

    • Keep track of previous node to update its next pointer.

    • Handle edge cases for first two nodes and last node.

    • Example: 1->2->3->4 becomes 2->1->4->3.

  • Answered by AI
  • Q4. Given a binary search tree. Traverse only the left sub-tree
  • Ans. 

    Traverse only the left sub-tree of a binary search tree.

    • Start at the root node

    • If the left child exists, visit it and repeat the process

    • If the left child does not exist, return to the parent node

    • Continue until all nodes in the left sub-tree have been visited

  • Answered by AI
  • Q5. Implementation of AVL tree. I told solution in nlogn. He asked me optimize further
  • Q6. Write a program to test whether a string and all strings that can be made using the characters of that string are palindrome or not Input Output mmo True yakak True travel False
  • Q7. Next, I was asked to design an efficient data structure for two lifts in a building of n floors
  • Ans. 

    Design an efficient data structure for two lifts in a building of n floors.

    • Use a priority queue to keep track of the floors each lift is heading to

    • Implement a scheduling algorithm to determine which lift to assign to a new request

    • Consider adding a weight limit to each lift to prevent overloading

    • Use a hash table to keep track of the current location of each lift

  • Answered by AI
  • Q8. Given a Integer, find the maximum number that can be formed from the digits. Input : 8754365 output : 8765543
  • Ans. 

    To find the maximum number that can be formed from the digits of an integer.

    • Convert the integer to a string

    • Sort the characters in descending order

    • Join the sorted characters to form the maximum number

  • Answered by AI

Interview Preparation Tips

Skill Tips: They were looking for really cool coders. High expectation on accurate answers. looking for deep understanding of algorithms and data structures.
Skills: Algorithms, Data structures
College Name: PSIT

Skills evaluated in this interview

OLX Interview FAQs

How to prepare for OLX Content Moderator 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 Fraud Detection, Maintenance and fraud control.

Tell us how to improve this page.

OLX Content Moderator Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Swiggy Interview Questions
3.8
 • 431 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
Info Edge Interview Questions
3.9
 • 318 Interviews
Lenskart Interview Questions
3.2
 • 308 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
CarDekho Group Interview Questions
3.7
 • 72 Interviews
View all
OLX Content Moderator Salary
based on 14 salaries
₹2.8 L/yr - ₹4.4 L/yr
17% more than the average Content Moderator Salary in India
View more details

OLX Content Moderator Reviews and Ratings

based on 2 reviews

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

4.6

Job security

5.0

Company culture

4.6

Promotions

5.0

Work satisfaction

Explore 2 Reviews and Ratings
Key Account Manager
149 salaries
unlock blur

₹3.2 L/yr - ₹8.6 L/yr

Dealer Success Manager
149 salaries
unlock blur

₹3 L/yr - ₹6.3 L/yr

Accounts Manager
109 salaries
unlock blur

₹2.7 L/yr - ₹6.8 L/yr

Senior Accounts Manager
70 salaries
unlock blur

₹3.9 L/yr - ₹8 L/yr

Retail Associate
65 salaries
unlock blur

₹2.9 L/yr - ₹6 L/yr

Explore more salaries
Compare OLX with

Quikr

3.7
Compare

eBay

3.8
Compare

Tokopedia

4.1
Compare

Flipkart

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