Upload Button Icon Add office photos
Engaged Employer

i

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

RedBus Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

RedBus IOS Developer Interview Questions and Answers

Updated 29 Aug 2024

RedBus IOS Developer Interview Experiences

2 interviews found

IOS Developer Interview Questions & Answers

user image Anonymous

posted on 29 Aug 2024

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Memory management
  • Q2. ARC and situation question

Calpion Software Technologies

Be part of a company where work compliments life, not consumes it.

IOS Developer Interview Questions & Answers

user image Anonymous

posted on 22 Oct 2023

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

I applied via Naukri.com and was interviewed in Sep 2023. There were 2 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 Resume tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Given a string, determine if a permutation of string could be a palindrome.
  • Q2. Linked list sum in reverse order (Leetcode #2. Add two numbers)
  • Ans. 

    Add two numbers represented by linked lists in reverse order.

    • Traverse both linked lists simultaneously, adding corresponding nodes and carrying over the sum if necessary.

    • Handle cases where one linked list is longer than the other.

    • Create a dummy head node to simplify the code.

    • Consider edge cases like carry over at the end of the addition.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - They focus on LinkedList, Tree, String, and Array in DSA Round and code in Swift.

Skills evaluated in this interview

IOS Developer Interview Questions Asked at Other Companies

Q1. 1 - MVC PATTERN 2- CLOUSERS & it's type 3- Google SDK like Go ... read more
asked in Movius Corp
Q2. What will be the output of the following Swift code: \n\nstruct s ... read more
asked in Capgemini
Q3. What’s difference between class and structure
asked in Movius Corp
Q4. What is the difference between the Liskov Substitution Principle ... read more
asked in Movius Corp
Q5. What is the time complexity for finding the longest common prefix ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Around asynchronous programming specifically in ios, design patterns, memory management?

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 65 minutes
Round difficulty - Easy

There were 2 sections – 
Aptitude and Logical Reasoning and MCQ based on Java question ,C++, coding for 20 min and 45 min respectively.
Section A- Not very difficult to clear this round although less time was a problem.
Section B- It contains 15 multiple choice question on c/c++,java and 4 simple coding questions

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for O(N) time complexity and O(1) space complexity.

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

It was an online coding test in which 3 coding question were given.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in string S that contains all characters in string X.

    • Iterate through string S and keep track of characters in X found in a window

    • Use two pointers to maintain the window and slide it to find the smallest window

    • Return the smallest window containing all characters in X

  • Answered by AI
  • Q2. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a non-decreasing sorted array of positive numbers.

    • Start with the smallest possible integer that cannot be represented, which is 1.

    • Iterate through the array and update the smallest integer that cannot be represented.

    • If the current element is greater than the smallest integer that cannot be represented, return tha...

  • Answered by AI
  • Q3. 

    Minimum Steps for a Knight to Reach Target

    Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...

  • Ans. 

    Calculate the minimum number of moves a Knight needs to reach a target position on a chessboard.

    • Implement a function that takes knight's starting position, target position, and chessboard size as input

    • Use breadth-first search algorithm to find the shortest path for the Knight

    • Consider all possible 8 movements of the Knight on the chessboard

    • Return the minimum number of moves required for the Knight to reach the target po

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

It started with a discussion on the programs given in coding round. They asked me about my interest field after that they directly jumped into Networking, Linux and Ethical Hacking part looking my interest domain. They asked me various question on networking and linux.
Then they asked me to code a simple c program

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node.

    • Keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during reversal.

  • Answered by AI
  • Q2. What are the port numbers of protocols such as FTP and SMTP?
  • Ans. 

    FTP uses port number 21 and SMTP uses port number 25.

    • FTP uses port 21 for data transfer and port 20 for control information.

    • SMTP uses port 25 for email communication.

    • Understanding port numbers is important for network communication.

  • Answered by AI
  • Q3. Can you explain the OSI Model?
  • Ans. 

    The OSI Model is a conceptual framework that standardizes the functions of a telecommunication or computing system into seven layers.

    • The OSI Model stands for Open Systems Interconnection Model.

    • It consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.

    • Each layer has specific functions and communicates with the adjacent layers.

    • Example: Layer 1 (Physical) deals with physi...

  • Answered by AI
  • Q4. How do you copy files in Linux?
  • Ans. 

    To copy files in Linux, you can use the 'cp' command.

    • Use the 'cp' command followed by the source file and destination directory to copy a file.

    • To copy a directory and its contents, use the '-r' flag with the 'cp' command.

    • You can also use wildcards like '*' to copy multiple files at once.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip 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 

8 Questions

  • Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
  • Ans. 

    Find the subset of an array with the largest sum of continuous positive numbers.

    • Iterate through the array and keep track of the current sum and the maximum sum seen so far.

    • If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.

    • Also keep track of the start and end indices of the maximum sum subset.

    • Return the subset using the start and end indices.

  • Answered by AI
  • Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
  • Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
  • Ans. 

    Find smallest substring in s1 containing all characters of s2.

    • Create a hash table of characters in s2

    • Use sliding window technique to find smallest substring in s1

    • Check if all characters in s2 are present in the substring

    • Update the smallest substring if a smaller one is found

  • Answered by AI
  • Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
  • Q5. Write algo for reversing a linked list
  • Ans. 

    Algorithm to reverse a linked list

    • Create a new empty linked list

    • Traverse the original linked list and insert each node at the beginning of the new list

    • Return the new list

  • Answered by AI
  • Q6. What is lazy loading? Advantages and disadvantages of the same?
  • Ans. 

    Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.

    • Advantages: faster initial page load, reduced bandwidth usage, improved user experience

    • Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO

    • Examples: images, videos, and other media files can be loaded only when they are visible on the screen

  • Answered by AI
  • Q7. How ajax works? Difference between angular js and jquery?
  • Ans. 

    Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.

    • Ajax stands for Asynchronous JavaScript and XML

    • It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes

    • AngularJS is a JavaScript framework that extends HTML with new attrib...

  • Answered by AI
  • Q8. Design a traffic light system?
  • Ans. 

    A traffic light system controls the flow of traffic at intersections.

    • The system consists of three lights: red, yellow, and green.

    • Each light has a specific duration for which it stays on.

    • The system also includes sensors to detect the presence of vehicles and pedestrians.

    • The duration of each light can be adjusted based on traffic patterns.

    • The system can be connected to a central control system for remote monitoring and m

  • Answered by AI

Interview Preparation Tips

Skills: Javascript, Ajax, Angular JS, Jquery
College Name: na

Skills evaluated in this interview

I was interviewed before Feb 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with 3 problems based on DSA and Algorithms.

  • Q1. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    Find the smallest positive integer that cannot be expressed as the sum of elements from any proper subset of a given array.

    • Sort the array in non-decreasing order.

    • Iterate through the array and keep track of the smallest sum that can be formed.

    • If the next element in the array is greater than the current sum + 1, then the answer is the current sum + 1.

    • Return the answer as the smallest integer not representable as a subset

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list to be the last node encountered during the reversal process.

  • Answered by AI
  • Q3. 

    Smallest Window Problem Statement

    Given two strings S and X containing random characters, the task is to find the smallest substring in S which contains all the characters present in X.

    Input:

    The first...
  • Ans. 

    The task is to find the smallest substring in string S which contains all the characters present in string X.

    • Iterate through string S and keep track of characters in X using a hashmap

    • Use two pointers to maintain a sliding window and find the smallest window containing all characters in X

    • Return the smallest window found

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions based on OOPS and Angular.

  • Q1. What are the different OOP concepts?
  • Ans. 

    OOP concepts include inheritance, encapsulation, polymorphism, and abstraction.

    • Inheritance allows a class to inherit properties and behavior from another class.

    • Encapsulation restricts access to certain components of an object, protecting its integrity.

    • Polymorphism allows objects to be treated as instances of their parent class.

    • Abstraction hides the complex implementation details of an object and only shows the necessar

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Questions based on System Design, ajax, jquery were asked.

  • Q1. How would you design a traffic light system?
  • Ans. 

    Designing a traffic light system involves creating a system that controls the flow of traffic at intersections.

    • Divide the traffic light system into three main lights: red, yellow, and green.

    • Implement timers to control the duration of each light.

    • Include sensors to detect the presence of vehicles and pedestrians.

    • Consider implementing a pedestrian crossing signal.

    • Integrate a central control system to coordinate the timing

  • Answered by AI
  • Q2. How does AJAX work?
  • Ans. 

    AJAX allows for asynchronous communication between client and server without needing to reload the entire page.

    • AJAX stands for Asynchronous JavaScript and XML.

    • It allows for sending and receiving data from a server without reloading the entire page.

    • AJAX uses XMLHttpRequest object to make requests to the server.

    • It can update parts of a web page without requiring a full page reload.

    • Commonly used in web applications to pro

  • Answered by AI
  • Q3. What is the difference between AngularJS and jQuery?
  • Ans. 

    AngularJS is a full-fledged MVC framework for building dynamic web applications, while jQuery is a lightweight library for DOM manipulation and event handling.

    • AngularJS is a full-fledged MVC framework, providing features like two-way data binding, dependency injection, and routing.

    • jQuery is a lightweight library primarily used for DOM manipulation and event handling.

    • AngularJS is suitable for building single-page applic...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Javascript, Ajax, Angular JS, Jquery, Data Structures, Algorithms, System Design, 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 interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

  • Q1. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

  • Q1. 

    Triangle Formation Using Array Elements

    Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...

  • Ans. 

    Determine if it is possible to form a non-degenerate triangle using array elements as sides.

    • Check if the sum of any two sides is greater than the third side for all combinations of sides.

    • If the above condition is met for any combination, return true; otherwise, return false.

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Elements

    You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...

  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

    • At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

    • Iterate through the array and update the maximum sum accordingly.

    • Example: F...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

  • Q1. 

    Sum Tree Conversion

    Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.

    • Traverse the tree in a bottom-up manner, starting from the leaf nodes.

    • For each node, update its value to the sum of its children's values.

    • Set leaf nodes to 0.

    • Return the preorder traversal of the modified tree.

  • Answered by AI
  • Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
  • Ans. 

    Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.

    • Types of indexes: B-tree, Hash, Bitmap, etc.

    • Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

    • Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

    • Examples: Creating an index on a column in a table to speed up search queries

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology Delhi (New Campus). Eligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, OS, DBMS, Algorithms, Networking, Coding, OOPTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances

Application resume tips for other job seekers

Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Company Website and was interviewed before Oct 2020. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Your Personal Details, Your Qualifications?
  • Ans. This answer must be basied on you resume.
  • Answered Anonymously
  • Q2. Why IndiaMart?
  • Ans. This type of question are based on you knowledge and your experiences
  • Answered Anonymously
  • Q3. What are you skills and how you would implement them while working with us?
  • Ans. For this you need to know you Positive Point and Negative Point which are totally based on your behavior and Personality
  • Answered Anonymously

Interview Preparation Tips

Interview preparation tips for other job seekers - Be Natural and Original while interviewing

I applied via Referral and was interviewed in May 2021. There were 2 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. The interview consisted a appitude test and second round was english speaking assessment test online , if you clear both the test, they will share the documentation link

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview process was easy.

I applied via Company Website and was interviewed in Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Fibonacci series, Prime function, linked lisk value access, query

Interview Preparation Tips

Interview preparation tips for other job seekers - First a test based on amcat. Followed by two technical interview. First Tech Interview basis and overview of you concept of ds and algo will ne asked. In second Tech interview indepth concept of topics such as arrays, linked list, os,algo, etc will be asked. Prepare ds and algo concept, dbms query & concept, internet basis such as protocols, methods,etc.

Best of luck
Contribute & help others!
anonymous
You can choose to be anonymous

RedBus Interview FAQs

How many rounds are there in RedBus IOS Developer interview?
RedBus interview process usually has 1-2 rounds. The most common rounds in the RedBus interview process are Resume Shortlist, One-on-one Round and Technical.
What are the top questions asked in RedBus IOS Developer interview?

Some of the top questions asked at the RedBus IOS Developer interview -

  1. Linked list sum in reverse order (Leetcode #2. Add two numbe...read more
  2. Given a string, determine if a permutation of string could be a palindro...read more
  3. ARC and situation quest...read more

Recently Viewed

SALARIES

Delta Electronics

SALARIES

Texas Instruments

SALARIES

Micron Technology

SALARIES

JCB

SALARIES

Thomson Reuters

SALARIES

JCB

SALARIES

Statcon Energiaa

INTERVIEWS

Toshiba

No Interviews

SALARIES

Apar Industries

DESIGNATION

Tell us how to improve this page.

RedBus IOS Developer Interview Process

based on 2 interviews

Interview experience

3.5
  
Good
View more

Sopra Steria

Rated 4 for Job Security by our employees on AmbitionBox

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Oyo Rooms Interview Questions
3.3
 • 218 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Zepto Interview Questions
3.5
 • 211 Interviews
Naukri Interview Questions
4.0
 • 185 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
View all
Software Engineer
107 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
71 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
63 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Executive
53 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
39 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare RedBus with

MakeMyTrip

3.6
Compare

Travelyaari

3.2
Compare

Goibibo

4.3
Compare

Yatra

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