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

Senior Software Developer

Rippling
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Dynamic Programming, Trees, Linked List, Grokking, Low Level Design from Educative, Grokking High Level Design from Educative
Tip
Tip

Tip 1 : Prepare HLD and LLD comprehensively
Tip 2 : Prepare good questions to ask from the Interviewer at the end.

Application process
Where: Linkedin
Resume Tip
Resume tip

Tip 1 : Keep it 1 page long

Tip 2 : Keep it to the point

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date23 Dec 2020
Coding problem1

1. Count Complete Binary Tree Nodes

Easy
10m average time
90% success
0/40
Asked in companies
FacebookDunzoLinkedIn

Given a complete binary tree, you are supposed to return the number of nodes in the given tree.

In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.

For example:
For the binary trees in the image below.

alt text

The left tree in the image is not a complete binary tree that’s why it is invalid and the right tree in the image is a valid complete binary tree which contains total 6 nodes.
Problem approach

Used Binary search to calculate the total number of nodes.

Try solving now
02
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date24 May 2022
Coding problem1

1. Mean Median Mode

Easy
10m average time
80% success
0/40
Asked in companies
MicrosoftAmazonRippling

You are given an array 'ARR' of 'N' integers and you have to calculate 3 things for the given array:-

1. Mean - function mean(): This function should calculate the mean of the array.

2. Median - function median(): This function should calculate the median of the array.

3. Mode - function mode(): This function should calculate the mode of the array.

Note :
It can be shown that Mean and Median is in the form of P/Q, where P and Q are coprime integers and Q != 0. You need to return P and Q.

For Mode, if the highest frequency of more than one element is the same, return the smallest element.

For Example, for the given array {1, 1, 2, 2, 3, 3, 4}, the mode will be 1 as it is the smallest of all the possible modes i.e 1, 2 and 3.
Problem approach

Just used proper abstraction and mapper factory pattern to solve the problem.

Try solving now
03
Round
Easy
HR Round
Duration60 minutes
Interview date27 May 2022
Coding problem1

1. Basic HR Questions

  • Introduce yourself
  • What are your strengths?
  • Where do you see yourself in 5 years?
Problem approach

Tip 1 : Be confident
Tip 2 : Be descriptive
Tip 3 : Open to listening to opinions

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
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
907 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
3319 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
2580 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Senior Software Developer
4 rounds | 13 problems
Interviewed by SAP Labs
1795 views
0 comments
0 upvotes
company logo
Senior Software Developer
3 rounds | 3 problems
Interviewed by BNY Mellon
1359 views
0 comments
0 upvotes
company logo
Senior Software Developer
4 rounds | 5 problems
Interviewed by Ernst & Young (EY)
3209 views
0 comments
0 upvotes