RedBus interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

RedBus
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I started coding from 11th class in my school. I did Codechef and Leetcode questions on daily basis , participated in every possible Hackathons to develop my skills.
Application story
Company visited to your campus for the placement where they first took the OA then they call us for the interview .
Why selected/rejected for the role?
I think i was rejected because i was not able to answer all the question correctly under the given time of the interview
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Ex- Do atleast 2 projects

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Keep your resume short and clear. Mention your projects and internships with a brief description and year of completion. Mention coding languages are known to you, or other technical skills that you are good at. Do not mention anything that you are not good at. Highlight the topics that you are really good at. 
Tip 2 : Be very honest and figure out only those things in your resume that you really know. Anything extra or unknown may have a negative impact upon your interview if asked by the interviewer.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date10 Feb 2022
Coding problem2

1. Power of Two

Easy
15m average time
85% success
0/40
Asked in companies
McAfeeAmazonQualcomm

You have been given an integer 'N'.


Your task is to return true if it is a power of two. Otherwise, return false.


An integer 'N' is a power of two, if it can be expressed as 2 ^ 'K' where 'K' is an integer.


For example:
'N' = 4,
4 can be represented as 2^2. So, 4 is the power of two, and hence true is our answer.
Try solving now

2. Restore IP Addresses

Moderate
15m average time
85% success
0/80
Asked in companies
FacebookAppleMicrosoft

You are given a string 'S' containing only digits. Your task is to find all possible IP addresses that can be obtained from string 'S' in lexicographical order.

Note:
A valid IP address consists of exactly four integers, each integer is between 0 and 255 separated by single dots, and cannot have leading zeros except in the case of zero itself.
For example:
The following are valid IP addresses:
0.1.24.255
18.5.244.1

Following are invalid IP addresses:
0.01.24.255  (as  01  contains one leading zero).
18.312.244.1 (as 312 not lies between 0 and 255).
Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date10 Feb 2022
Coding problem2

1. Merge Sort

Easy
15m average time
85% success
0/40
Asked in companies
Hewlett Packard EnterpriseIBMPhonePe

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

subsequence

The above illustrates shows how merge sort works.
Note :
It is compulsory to use the ‘Merge Sort’ algorithm.
Problem approach

It works on the principle of Divide and Conquer. Merge sort repeatedly divides the array into several arrays until each array consists of a single element and merging those arrays in a manner that results into a sorted array.

Pseudocode :
MergeSort(A, p, r):
if p > r 
return
q = (p+r)/2
mergeSort(A, p, q)
mergeSort(A, q+1, r)
merge(A, p, q, r)

Merge function : The task is to merge two subarrays A[p..q] and A[q+1..r] to create a sorted array A[p..r].
Steps :
Create copies of the subarrays L ← A[p..q] and M ← A[q+1..r].
Create three pointers i, j and k
i indicates current index of L, starting at 1
j indicates current index of M, starting at 1
k indicates the current index of A[p..q], starting at p.
Until we reach the end of either L or M, pick the larger among the elements from L and M and place them in the correct position at A[p..q]
When we run out of elements in either L or M, pick up the remaining elements and put in A[p..q]
Time complexity : O(nlogn)

Try solving now

2. Insertion Sort in Linked List

Easy
10m average time
90% success
0/40
Asked in companies
Disney + HotstarIntuitAmazon

You are given an arbitrary linked list consisting of 'N' nodes having integer values. You need to perform insertion sort on the linked list and print the final list in sorted order.

In other words, you are given a singly linked list, you need to perform insertion sort on it.

Insertion Sort is a sorting algorithm that removes one element from the input data, finds the location it belongs within the sorted list and inserts it there. It repeats until no input elements remain.
Problem approach

1) Create an empty sorted (or result) list
2) Traverse the given list, do following for every node.
......a) Insert current node in sorted way in sorted or result list.
3) Change head of given linked list to head of sorted (or result) list.

Try solving now
03
Round
Medium
HR Round
Duration60 minutes
Interview date10 Feb 2022
Coding problem1

1. Basic HR Questions

1. Tell me about yourself?
2. Why are you interested in this position? 
3. Why are you leaving your current job? 
4. Can you describe a work or school instance in which you messed up? 
5. Tell me about a time when you experienced conflict with a co-worker and how you dealt with it?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is the purpose of the return keyword?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 2
4 rounds | 4 problems
Interviewed by RedBus
1978 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 4 problems
Interviewed by RedBus
1601 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by RedBus
1509 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by RedBus
688 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15556 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15417 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10180 views
2 comments
0 upvotes