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

SDE - 1

Licious
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I started my programming journey back in the 4th semester, belonging to a non-CS background in school. Initially, it started with a coding platform. It's almost a year's journey now. The question count is around 1300+, including 100+ hard and 800+ medium questions.
Application story
Back in June, I came across a job post that mentioned openings in Licious for an SDE1 role, I applied directly for it.
Why selected/rejected for the role?
One of the positive reasons for my selection is the code structure I followed in my designing round: the variables should be self-defining, a proper understanding of the given problem statement, and ensuring sufficient understanding before coding.
Preparation
Duration: 4 months
Topics: Low level design, core subjects, Data structure and algorithms, Trees , Graph
Tip
Tip

Tip 1: Make sure to solve at least 5-6 low-level design questions beforehand. 

Tip 2: The variables should be self-defining in nature. 

Tip 3: Revise core subjects.

Application process
Where: Linkedin
Eligibility: 7 CGPA and above
Resume Tip
Resume tip

Tip 1: Add only real achievements. 

Tip 2: An in-depth understanding of the topic that you have written in your resume is a must.

Interview rounds

01
Round
Medium
Video Call
Duration45 minutes
Interview date10 Jun 2023
Coding problem2

Started with introduction about each other. Then started with Dynamic programming problem which eventually came to House Robber 2. And later, one more question was asked which is the lowest common ancestor in a binary tree.

1. House Robber II

Moderate
15m average time
80% success
0/80
Asked in companies
SalesforceUberExpedia Group

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses in this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.

Given an integer array nums representing the amount of money in each house, return the maximum amount of money you can rob tonight without alerting the police.

Problem approach

Tip 1: The answer always is the maximum of the take or not take value, which is basically whether a particular house should be robbed or skipped.

Try solving now

2. LCA Of Binary Tree

Moderate
10m average time
90% success
0/80
Asked in companies
American ExpressAmazonAcko

You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.


The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.


Note :
You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.
For example :
For the given binary tree

Example

LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.
Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date12 Jun 2023
Coding problem1

Again started with introduction, project that built during college and previous internship experience. Then an LLD question of split wise asked. Expectation is class design, relationship, and schema.

1. System Design

Expense-sharing applications are used to log, track, and monitor the expenses of users with each other or in a group. The most famous example of such an application is Split-wise. Design Split-wise.

Problem approach

Proper schema design is expected, make sure to pick one step at a time and don't unnecessarily complicate this round by asking unwanted questions. Make sure to understand the necessary requirements and code them, then only opt for optional ones.

03
Round
Medium
Video Call
Duration60 Minutes
Interview date15 Jun 2023
Coding problem1

Started with introduction and previous internship experience. Then shared a Google Docs document which already had a problem statement stated. It's something related to designing a medical store where each medicine has its components and proportions needed in the mixture. Requirements were also given; we have to come up with an approach; no coding is required, only schema is needed. Then discussed the CAP theorem along with why CA is not possible in a distributed environment.

1. System Design

It's something related to designing a medical store where each medicine has its components and the proportion in which the mixture is needed. Requirements are also given; we have to come up with an approach. No coding is required; only a schema is required. Then CAP theorem, along with why CA is not possible in a distributed environment.

Problem approach

Even if you don't know about a particular topic, try to tackle the problem by solving it in pieces. The above problem is solved using graph-based databases like Neo database.

Here's your problem of the day

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

Skill covered: Programming

Which traversal uses a queue as its primary data structure?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
2839 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
5183 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
1971 views
0 comments
0 upvotes
company logo
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
1742 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
110395 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
54212 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
33222 views
6 comments
0 upvotes