Rudder Analytics interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Rudder Analytics
2 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
My coding journey started a bit later than my batchmates and friends. I was very careless during the first two years of my graduation. I began learning to code in my third year, which is a bit unusual. I learned C++ and then started practising DSA using a 150-question sheet from YouTube. I also learned web development through an online course. Because I started late, I had to increase my practice hours. In the end, I was able to secure a job as an SDE-1 at Rudder Analytics.
Application story
It was placement season, and we were worried about our job prospects since we were at a tier 3 college. Not many companies visited our campus, which was disheartening. However, my friend informed me that Rudder Analytics was coming to our campus to hire candidates for the SDE-1 position. I was very happy about the opportunity and participated in the interview process.
Why selected/rejected for the role?
I was selected for the position because they were looking for someone with strong analytical skills and good communication abilities. I was able to demonstrate my proficiency in both areas.
Preparation
Duration: 2 months
Topics: C++, DSA, Python, SQL, Data Structures, OS, DBMS
Tip 1: Practice previously asked interview and online test questions.
Tip 2: Review all previous interview experiences.
Tip 3: Complete at least two good projects and ensure you know every detail about them.
Application process
Where: Campus
Eligibility: 7 CGPA
Mention the projects that are most relevant to the job position you are applying for and those you are most knowledgeable about.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date14 Dec 2022
Coding problem2
The online round consisted of 2 coding questions based on data structures and algorithms, 30 aptitude MCQs, 30 behavioural MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy, and the code snippets to debug were also easy. Each section was timed.
1. Palindrome Linked List
Easy
20m average time
90% success
0/40
Asked in companies
You are given a singly Linked List of integers. Your task is to return true if the given singly linked list is a palindrome otherwise returns false.
For example:
The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.
It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward.
Follow Up:
Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?
Problem approach
- I used a stack to solve this problem.
- Traverse the given list from head to tail, pushing each visited node onto the stack.
- Traverse the list again. For each visited node, pop a node from the stack and compare the data of the popped node with the current node.
- If all nodes match, return true; otherwise, return false.
2. Unique Paths
Moderate
25m average time
80% success
0/80
Asked in companies
You are present at point ‘A’ which is the top-left cell of an M X N matrix, your destination is point ‘B’, which is the bottom-right cell of the same matrix. Your task is to find the total number of unique paths from point ‘A’ to point ‘B’.In other words, you will be given the dimensions of the matrix as integers ‘M’ and ‘N’, your task is to find the total number of unique paths from the cell MATRIX[0][0] to MATRIX['M' - 1]['N' - 1].
To traverse in the matrix, you can either move Right or Down at each step. For example in a given point MATRIX[i] [j], you can move to either MATRIX[i + 1][j] or MATRIX[i][j + 1].
Problem approach
The recursive formula is as follows:
int numberOfPaths(int m, int n)
{
if (m == 1 || n == 1)
return 1;
return numberOfPaths(m - 1, n) + numberOfPaths(m, n - 1);
}
However there are overlapping problems hence, we use DP to further optimize it.
02
Round
Medium
Video Call
Duration60 minutes
Interview date15 Dec 2022
Coding problem3
The interview was early at 9 am. We turned on our videos and the interviewer asked for my introduction. She was helpful and provided me with hints whenever I needed. The interview was taken on Amazon Chime and she also shared a link where I can write the code. It could be editable by both of us.
1. Find Number Of Islands
Moderate
34m average time
60% success
0/80
Asked in companies
You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.
A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).
A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.
Problem approach
A cell in a 2D matrix can be connected to 8 neighbours, so we can recursively call for each of the 8 neighbours. We keep track of the visited 1s to ensure they are not visited again. I provided solutions using both BFS and DFS and also had to code both methods. This question was followed by other graph-related questions.
2. DBMS Questions
Problem approach
Tip 1: Give your answer in a structured manner. Also, don't use those technical terms which you aren't clear with.
Tip 2: Try to communicate clearly with the interviewer. Explain your solution clearly.
3. OOPs Questions
- Define copy constructor. Where it is used? (Learn)
- Define encapsulation and abstraction.
Problem approach
Tip 1: Refer to OOPs modules in Coding Ninja's Data Structure and Algorithm course. It is great for OOP concepts.
Tip 2: Always give proper definitions along with examples.
Tip 3: Make notes for topics like OOPs and DBMS while preparing.
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 recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 3 problems
Interviewed by Rudder Analytics
Selected 
5986 views
0 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 4657 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
Selected 3688 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
Selected 2650 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
Selected 2324 views
0 comments
0 upvotes