Rippling

Role: SDE (FTE + 6 Month Internship)

College: Not Specified

Interview Date: Not Specified

Interview Type: Full-Time + Internship

Result: Not Specified (Cleared online round)

Difficulty: Medium-Hard

Rounds: Online Coding Round, Round 1 (Technical), further rounds implied

Topics Asked: Data Structures, Algorithms (Tree+DP, Binary Search, Array Manipulation, Sliding Window)

Experience:

The selection process started with an online coding round.

Online Coding Round:
This round consisted of 2 medium-hard and 1 easy-medium coding questions based on tree+dp and binary search. The candidate cleared this round by solving 2.5 questions. Questions included:

• "Given an array of integers of size n and a number k. We have to remove one number either from the leftmost or rightmost element from an array. Repeat it k times. We have to find the maximum sum of these k numbers."
• A variation of the above: "Another array value of length k is given. While removing the number from the array, we have to multiply with this number. If we remove i1, i2.. ik indices from the array then we have to find maximum value of this arr[i1]*value+arr[i2]*value+arr[i3]*value... arr[ik]*value[k-1];"

Round 1: Technical Interview (45 min)
The round began with interviewer and candidate introductions, followed by a discussion of the candidate's projects. A coding question was then presented: "Given an array consisting of integers of size n and number k. Starting at the 0 indexes, you have to reach the n-1 index by jumping. If you are at index I, then u can jump to any index between i+1 to i+k. When u jump on the index, arr[i] is added to ur sum. The problem is to find the maximum sum when u start at index 0 and reach n-1." The candidate coded recursive and DP approaches for this problem.