Upload Button Icon Add office photos

Filter interviews by

Indus OS Interview Questions and Answers

Updated 9 Oct 2021

Indus OS Interview Experiences

1 interview found

I applied via Indeed and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. What's your ambition in life ??
  • Q2. In the beginning just started with introducing myself
  • Q3. Was asked related to the Job profile and also well explained by HR
  • Q4. Interview was in straight forward

Interview Preparation Tips

Interview preparation tips for other job seekers - Totally interview was of 3 round ,
Before each n every round hr properly notified me and u can reach out to them if u have any doubts regards interview or job description... Questions shooted was related to the respective profile no irrelevant questions were asked, be prepared and gather some information about company ....

Interview questions from similar companies

Interview Questionnaire 

3 Questions

  • Q1. N a line where words are separated by spaces, , and capitalize first letter of the reversed word. Other letters of the word should be in small. Input : “how are you?” → Output: “Woh Era ?uoy”
  • Ans. 

    The program capitalizes the first letter of each reversed word in a sentence.

    • Split the sentence into an array of words using space as a delimiter.

    • Reverse each word in the array and capitalize the first letter.

    • Join the modified words back into a sentence.

  • Answered by AI
  • Q2. He second question reduced to finding maximum weight matching in a bipartite graph. Not many people would have done this (maybe none)
  • Q3. There are 2 sets of countries. One set will donate clothes (something of this sort) and anotherset will accept clothes. A country can be in only 1 of the sets. The amount of clothes donated is also given. ...

Interview Preparation Tips

Round: Test
Experience: There were about 20 MCQs (30 minutes) to be done after the coding section. MCQs were totally nonsense. Can be done in 10 mins.For coding section 60 mins.  It was hosted on Hackerrank.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: After this, selected candidates were interviewed that consists of 4 rounds and discussion was mostly on your CV and data structure problems.

General Tips: Be honest with your interviewer. If you are not comfortable in 1 topic, tell your interviewer honestly. Do well in other areas. Look for hints from the interviewer if you get stuck. They want to see how you approach a problem.
Skills: Algortihm, Data structure
College Name: IIT DELHI

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DSA were discussed.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array within the first array.

    • Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.

    • Compare elements from both arrays and place the larger element at the end of ARR1.

    • Continue this process until all elements are merged in sorted order within ARR1.

  • Answered by AI
  • Q2. 

    Reverse Alternate Levels of a Perfect Binary Tree Problem Statement

    Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...

  • Ans. 

    Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.

    • Traverse the tree in level order and store nodes at even levels in a separate list.

    • Reverse the list of nodes at even levels.

    • Update the tree with the reversed nodes at even levels.

    • Repeat the process for alternate levels starting from level 2.

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on OS, Java were discussed.

  • Q1. What are the characteristics of distributed file systems?
  • Ans. 

    Characteristics of distributed file systems include scalability, fault tolerance, and data replication.

    • Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.

    • Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.

    • Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...

  • Answered by AI
  • Q2. Design a file sharing mechanism between two users.
  • Ans. 

    Design a file sharing mechanism between two users.

    • Implement a secure login system for both users.

    • Allow users to upload files to a shared server.

    • Provide a way for users to view and download files shared by the other user.

    • Implement access control to ensure only authorized users can access the shared files.

  • Answered by AI
  • Q3. What is ConcurrentHashMap in Java?
  • Ans. 

    ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.

    • ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.

    • It achieves thread-safety by dividing the map into segments, each of which can be locked independently.

    • ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.

    • Example:...

  • Answered by AI
  • Q4. How do you analyze the usage history of an application?
  • Ans. 

    Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.

    • Collect and store user interaction data such as clicks, page views, and time spent on each feature.

    • Use analytics tools to generate reports and visualize usage patterns.

    • Identify popular features, user preferences, and areas for improvement based on usage data.

    • Implement A/B testing to compare different ver...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPS, Operating SystemsTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round with questions based on DSA.

  • Q1. 

    Binary Tree Traversals

    Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.

    Input:
    T
    For each test cas...
  • Ans. 

    Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.

    • Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.

    • Use recursion to traverse the binary tree efficiently.

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

    • Follow the order of nodes as they appear in the level order traversal.

    • Ensure the output is space-separated lists for each traversal type.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly.

    • Ensure to handle cache capacity by evicting the least recently used item when the cache is full.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA, OS etc.

  • Q1. 

    Number of Islands II Problem Statement

    You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....

  • Ans. 

    The task is to determine the number of islands present on a 2D grid after each query of converting water to land.

    • Create a function that takes the grid dimensions, queries, and coordinates as input.

    • For each query, convert the water at the given coordinates to land and update the grid.

    • Use depth-first search (DFS) to find connected lands and count the number of islands.

    • Return the number of islands after each query.

  • Answered by AI
  • Q2. Why are synchronized blocks needed in Java?
  • Ans. 

    Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.

    • Prevents multiple threads from accessing critical sections of code simultaneously

    • Ensures data consistency and prevents race conditions

    • Improves performance by reducing contention for shared resources

    • Example: synchronized block in a method that updates a shared variable

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, OS, Aptitude, OOPSTime required to prepare for the interview - 3 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 interviewRejected

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This test has 2 sections :
Section 1 ( Technical objective questions) 
– 25 mcq’s mainly focusing on c , c++ , os , data structures , algorithms
Section 2 ( 2 Coding questions )
– Code was supposed to be written on paper.

  • Q1. 

    Next Greater Number Problem Statement

    Given a string S which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...

  • Ans. 

    Given a number represented as a string, find the smallest number greater than the original with the same set of digits.

    • Sort the digits in non-increasing order to find the next greater number.

    • Swap the last two digits to get the smallest greater number.

    • If no greater number exists, return -1.

  • Answered by AI
  • Q2. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string by reversing the order of words while maintaining spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

First round of interview was based on basic data structures. Concepts related to binary search tree , uses and comparing complexity were asked. He also asked about Hashing , Collisions.

  • Q1. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Find K largest elements in an unsorted array and return them in non-decreasing order.

    • Sort the array in non-decreasing order

    • Return the last K elements of the sorted array

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interview started with a programming question. Then he asked me a puzzle. There was a small discussion about my projects then .Then he started asking questions about operating system. The interviewer wanted to test my understanding about semaphores and asked some tricky and confusing questions .

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    Return the level order traversal of a binary tree given in level order with null nodes represented by -1.

    • Parse the input to create the binary tree using level order traversal

    • Use a queue to perform level order traversal and print the nodes in the order visited

    • Handle null nodes represented by -1 appropriately

  • Answered by AI
  • Q2. Explain the Producer-Consumer problem and how it can be solved using semaphores.
  • Ans. 

    Producer-Consumer problem involves multiple threads sharing a common buffer. Producers add items to the buffer while consumers remove them.

    • Producers and consumers need to synchronize their access to the shared buffer to avoid race conditions.

    • Semaphores can be used to control access to the buffer. Two semaphores are used - one to track the empty slots in the buffer and one to track the filled slots.

    • Producers increment t...

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Peak Element Finder

    For a given array of integers arr, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, if arr[i] is the peak, then both...

  • Ans. 

    Find the peak element in an array of integers.

    • Iterate through the array and check if the current element is greater than its neighbors.

    • Handle edge cases for the first and last elements of the array.

    • Return the peak element found.

  • Answered by AI
Round 5 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This round was a telephonic interview with the CTO of the company. The he started with a small discussion about my projects and research paper .He then moved on to data structures and asked me how to choose a relevant data structure for a given problem. I gave him advantages of every data structure and certain problems where specific data structures could be useful .Then he gave a question and asked me for what data structure should be used keeping time complexity in mind. He asked me a few HR questions in the end .

  • Q1. 

    Average Marks Problem Statement

    Given the initial letter of a student's name and three integer marks for that student, calculate and display the student's initial letter followed by the integer part of th...

  • Ans. 

    Calculate and display the student's initial letter followed by the integer part of their average marks.

    • Calculate the average of the three marks provided for each student.

    • Display the initial letter of the student's name followed by the integer part of the average marks.

    • Round down the average to the nearest integer to get the integer part.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use two heaps - a max heap to store the smaller half of the numbers and a min heap to store the larger half.

    • Keep the sizes of the two heaps balanced to efficiently calculate the median.

    • If the total number of elements is odd, the median will be the top element of the max heap.

    • If the total number of elements is even, the median will be the avera

  • Answered by AI
  • Q2. 

    Pair Sum in Binary Search Tree

    Given a Binary Search Tree (BST) and a target value 'K', determine if there exist two unique elements in the BST such that their sum equals the target 'K'.

    Explanation:

    A ...

  • Ans. 

    Given a BST and a target value, determine if there exist two unique elements in the BST such that their sum equals the target.

    • Traverse the BST in-order to get a sorted array of elements.

    • Use two pointers approach to find the pair sum in the sorted array.

    • Keep track of visited elements to ensure uniqueness.

    • Handle edge cases like null nodes and empty tree.

    • Example: For input BST [20, 10, 35, 5, 15, 30, 42, -1, 13, -1, -1, -

  • Answered by AI
  • Q3. 

    Statistics From A Large Sample Task

    Calculate various statistical measures given a large sample of integers in the range [0, 255]. For efficiency, you are provided with an array 'count' where the i-th ele...

  • Ans. 

    Calculate various statistical measures given a large sample of integers in the range [0, 255] using the provided frequency array.

    • Iterate through the 'count' array to calculate minimum and maximum values.

    • Calculate the mean by summing up all values and dividing by the total count.

    • Find the median by sorting the sample and determining the middle element(s).

    • Identify the mode by finding the element with the highest frequency...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA. A puzzle was also asked.

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when inserting new items.

    • Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.

  • Answered by AI
  • Q2. 

    Sorting of a Rotated Sorted Array Problem Statement

    You are provided with a rotated sorted array of size N. Your task is to sort the given array in increasing order.

    Example:

    Input:
    N = 4
    Array = [2, 3,...
  • Ans. 

    Implement a function to sort a rotated sorted array in increasing order without using the sort() function.

    • Find the pivot element in the rotated sorted array.

    • Split the array into two subarrays based on the pivot element.

    • Sort each subarray separately.

    • Merge the sorted subarrays to get the final sorted array.

  • Answered by AI
  • Q3. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike 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 Preparation Tips

Round: Test
Experience: it was a basic test, CAT level questions and can be easily cleared
Tips: keep your cool, don't panic
Duration: 60 minutes
Total Questions: 60

College Name: IIT BOMBAY

Analyst Interview Questions & Answers

Ola Cabs user image Satyam Mudaliar

posted on 18 Sep 2015

Interview Preparation Tips

Round: Test
Experience: English was unpredictable.. Maths was easy but it will be good if you have practice, logical reasoning requires practice but are interesting
Tips: Leave english comprehensions for the end.. Do not waste too much time on one question even if it appears easy.. attempt the paper in the order of your comfort and mark every questions in case of NO negative marking
Duration: 60 minutes

Round: HR Interview
Tips: Smile!! And think before speaking anything, else you may contradict your own point.. Prepare "Tell me about yourself" well and guide your interview by focusing on your strongest point, you may face more questions on that point.. refer to 64 HR questions book

Round: Stress Interview
Tips: If they are giving you stress, that means they like you.. Relax!! Do not get nervous, thats what they want to check.. Think for the solution to the problem normally, you know you can crack it (Stress interview may be a part of HR, technical, case or any other interview.. you may have to make it out yourself)

Skill Tips: ""
Skills: Puzzles, Speaking skills, Aptitude, guesstimates, Case solving, presentation skills
College Name: IIT Bombay

Business Analyst Interview Questions & Answers

Ola Cabs user image Vishnuvardhan Reddy Kotte

posted on 21 Feb 2015

Interview Questionnaire 

3 Questions

  • Q1. Give some quantifiable factors you can use to rate( for comapny's purpose) among a repository of cab drivers we have?
  • Ans. 

    Quantifiable factors to rate cab drivers for company's purpose

    • Customer ratings and feedback

    • Number of completed trips

    • Average trip duration

    • Percentage of on-time pickups

    • Accident and traffic violation history

    • Vehicle cleanliness and maintenance

    • Driver punctuality and professionalism

  • Answered by AI
  • Q2. If you are on the selection committee of BCCI what would be your criterion for choosing between Yuvraj Singh and Stuart Binny for the World Cup squad?
  • Ans. 

    The criterion for choosing between Yuvraj Singh and Stuart Binny for the World Cup squad would be based on their recent performance, fitness, and team balance.

    • Evaluate recent performance of both players

    • Assess fitness levels of both players

    • Consider team balance and required skill sets

    • Analyze pitch and weather conditions of the tournament

    • Take into account the opposition teams and their strengths and weaknesses

  • Answered by AI
  • Q3. Some questions on programming (Pseudo Codes )

Interview Preparation Tips

Round: Test
Experience: There were questions on general aptitude like work and time, probability, and some questions were on data interpretation, coding and decoding, etc., most of the questions were very simple...but I felt the data interpretation questions to be a bit tricky (completely my opinion though).. ON THE BASIS OF THIS TEST THEY SHORTLISTED ROUGHLY 15 OUT OF 150 (again a rough figure)
Tips: Manage your time wisely...start with the type of questions you feel comfortable...try to attempt all the questions....improve your speed while practicing.
Duration: 45min minutes
Total Questions: 45

Round: Test
Experience: We were given 3 questions to solve in 30 min duration.Later we were told to walk them through our solution . Two of them were on probability(one random variables and the other on basic probability) and one was on estimating the area of an irregular figure , given some tools.
Tips: Get all the doubts regarding the questions clarified .As you have to explain your solution, it would be helpful if you could pen down all the steps clearly ( as it shows them that your thought process is an organised one). Use pictorial representation if needed. When they propose some other method be open to it and be open to any method they propose and be clear with the method you adopted. Even if you didn't arrive at the final answer, try to communicate your idea on solving the problem( most of the times they will listen to what you say).
Duration: 30min minutes
Total Questions: 3

Round: Other Interview
Experience: They were basically looking for quantifiable factors...so think of some quantifiable factors like the number of Times they are available to you in a day and the number of service providers they engage with. etc.,
For the second question again use quantifiable factors which make sense.
Tips: They patiently listened to what I said . So, be calm and don't be in a haste.

Skill Tips: Be a bit quick while solving the Aptitude questions....Know about the company before you go in for the interview process....No need of any prior knowledge in R language ...They just tested my Willingness to learn new things.
Skills: Aptitude Skills, Communication Skills, Structured thought process, Out of the box thinking, Basic programming skills ( very basic)
College Name: IIT KANPUR

Business Analyst Interview Questions & Answers

Paytm user image Rockey Maheshwari

posted on 8 Sep 2015

Interview Preparation Tips

Round: Test
Experience: It was a test of moderate level.

20 ques in 20 min.

Basic focus was speed and accuracy.

Tested calculation speed.
Tips: Try to decide which ques to answer and which ones to leave.

Its very important not to get stuck in any 1 ques and waste time. MOVE ON!
Duration: 20 minutes
Total Questions: 20

Round: Technical Interview
Experience: Hi ! i dont remember the question but I do remember that they were easy.

The interviewers are there to test you not to embarrass you. or humiliate you.
They dont expect you to answer every ques so no need to get frustrated if you get a couple of them wrong.
Tips: Go easy...
If you dont know answer to a ques , dont panic,. They are willing to qive you points for your approach.

General Tips: Relax at all times
Skill Tips: Just practice. Whenever you are on facebook solve a couple of brain teasers.


Skills: Aptitude
College Name: DTU
Motivation: Good Future prospects!

Indus OS Interview FAQs

How to prepare for Indus OS 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 Indus OS. The most common topics and skills that interviewers at Indus OS expect are Java, Python, Selenium, Appium and Manual Testing.

Tell us how to improve this page.

Interview Questions from Similar Companies

BYJU'S Interview Questions
3.1
 • 2.1k Interviews
Paytm Interview Questions
3.3
 • 753 Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
PolicyBazaar Interview Questions
3.6
 • 357 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
PhonePe Interview Questions
4.0
 • 300 Interviews
Freshworks Interview Questions
3.5
 • 159 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
InMobi Interview Questions
3.5
 • 35 Interviews
Hike Interview Questions
3.6
 • 32 Interviews
View all

Indus OS Reviews and Ratings

based on 17 reviews

4.5/5

Rating in categories

3.8

Skill development

4.2

Work-life balance

4.1

Salary

3.9

Job security

4.4

Company culture

4.3

Promotions

4.2

Work satisfaction

Explore 17 Reviews and Ratings
Data Analyst
9 salaries
unlock blur

₹4 L/yr - ₹8 L/yr

Test Engineer
8 salaries
unlock blur

₹3 L/yr - ₹6.3 L/yr

Software Engineer
7 salaries
unlock blur

₹11 L/yr - ₹29 L/yr

Lead Data Scientist
7 salaries
unlock blur

₹44 L/yr - ₹60 L/yr

Softwaretest Engineer
6 salaries
unlock blur

₹4 L/yr - ₹7.5 L/yr

Explore more salaries
Compare Indus OS with

Paytm

3.3
Compare

InMobi

3.5
Compare

Hike

3.6
Compare

Zomato

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