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

SDE - 1

Rizzle
upvote
share-icon
2 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: Arrays, Linked List, System Design, Hashmaps, Trees and Graphs
Tip
Tip

Tip 1 : Practice aptitude
Tip 2 : Focus on practicing coding
Tip 3 : Learn from mistakes

Application process
Where: Campus
Eligibility: No Backlogs
Resume Tip
Resume tip

Tip 1 : Mention some projects that you have done
Tip 2 : Try to have skills that are required for the role

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date5 Apr 2022
Coding problem3

The interviewer introduced herself and asked me to tell her about my current work and project. This went on for around 10 minutes then she jumped to questions. She was a Lead Engineer at Rizzle.

1. First Repeated Character

Moderate
30m average time
70% success
0/80
Asked in companies
EcomExpressDelhiveryAmazon

You are given a string 'STR' of lowercase English alphabets. You need to find the repeated character present first in the string.

Example:
If the string is: “abccba”, then the first repeated character is ‘c’, but the repeated character that is present first in the string is ‘a’. You need to print ‘a’.
Note:
Keep in mind that you need to print the repeated character that is present first in the string and not the first repeating character.
Problem approach

I came up with the hashing approach and the interviewer was satisfied with the approach.

Try solving now

2. Construct 'P' Palindromic Strings

Moderate
20m average time
80% success
0/80
Asked in companies
UberSnapdeal Ltd.alibaba

Given a string ‘S’ and an integer ‘ p ’. You need to find if you can make ‘ p ’ number of non-empty palindromic strings by using all the characters of string ‘ S ’. Note that you can use a character only once and if there are more than once occurrence of that character you can use it that many times only.

For Example :
If the given string is “ninjas” and p = 4 then we can make 4 palindromic strings as “nin” + “j” + “a” + “s”.
Problem approach

Step 1 : Store the frequency of all characters in a Map.

Step 2 : Count the number of characters having an odd frequency.

Step 3 : If the count is less than given K, then print “No”. Otherwise, print “Yes”.

Try solving now

3. Theory Questions

  • What are the specialties of NodeJS.
  • What is the difference between HTTP and HTTPS?
  • What is the difference between SQL and NoSQL?
  • What is Race Condition?
  • What are four criteria for Deadlock to happen?
  • What is LRU policy?
Problem approach

Tip 1 : Also focus on theory part

Tip 2 : Refer to internet for frequently asked theoretical questions

02
Round
Easy
Video Call
Duration75 minutes
Interview date6 Apr 2022
Coding problem3

One week later HR scheduled this round. The interviewer introduced himself and asked me to tell him about my current work and project. He quickly jumped to questions. He was a Director of Engineering at Rizzle.

This Round has Two coding Questions and One HLD question.

1. Reverse vowels in a string

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

You are given a string 'S'. Your task is to reverse the vowels in the string while keeping the consonants unchanged.

Note:

The alphabets 'a', 'e', 'i', 'o', and 'u' are vowels, while all the remaining alphabets are consonants.
Problem approach

I gave him a linear time approach and he was happy with that

Try solving now

2. Decode String

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

You have been given an encoded string. Your task is to decode it back to the original string.

- An encoded string will be of the form <count>[encoded_string], where the 'encoded_string' inside the square brackets is being repeated exactly 'count' times. Note that 'count' is guaranteed to be a positive integer and can be greater than 9.
- There are no extra white spaces and square brackets are well-formed.
For example -
Input: 2[a]
“a” is encoded 2 times, hence the decoded string will be "aa".

Input: 3[a2[b]]
“b” is encoded 2 times, which decodes as 3[abb]. Now, "abb" is encoded 3 times, hence decoded string will be "abbabbabb". 
Problem approach

I was able to come up with the stack-based approach. I explained to him the approach and wrote the code. He then asked me to run it. fortunately, all test cases passed.

Try solving now

3. System Design

Design a Job scheduler. There is a POST API through which we will be receiving a Job id and a timestamp. We need to push this job id to some queue at the given timestamp.

Problem approach

Tip 1 : Focus on HLD System Designing Questions

Tip 2 : Prior practice is a must for system design questions

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
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
961 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes