Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Licious Team. If you also belong to the team, you can get access from here

Licious Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Licious Software Development Engineer II Interview Questions and Answers

Updated 2 Dec 2024

Licious Software Development Engineer II Interview Experiences

2 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Jun 2024. There were 3 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Machine coding on Order Management System
  • Q2. Java related advance questions
Round 2 - Technical 

(2 Questions)

  • Q1. Healthy discussion on designing a system
  • Q2. Managerial questions
Round 3 - Culcural Fit 

(2 Questions)

  • Q1. Scenario based questions like How did you handle a situation where your colleague was unresponsive on something
  • Q2. Scenario based questions like What were the positive and constructive feedbacks you got from your manager

Interview Preparation Tips

Topics to prepare for Licious Software Development Engineer II interview:
  • System Design
  • DSA
  • Java
  • Spring Boot
  • SQL
  • Kafka
Interview preparation tips for other job seekers - Just focus on your technical skills along with sound knowledge on system design and good understanding of DSA
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Oct 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. 2 online Leetcode Medium questions.
  • Q2. Graph BFS and DFS
Round 3 - Technical 

(2 Questions)

  • Q1. Low level design discussion
  • Q2. Design a recommendation engine.
  • Ans. 

    Design a recommendation engine for personalized suggestions based on user preferences and behavior.

    • Collect user data such as browsing history, purchase history, ratings, and interactions.

    • Use collaborative filtering, content-based filtering, or hybrid approaches to generate recommendations.

    • Implement algorithms like matrix factorization, k-nearest neighbors, or neural networks for personalized suggestions.

    • Regularly updat...

  • Answered by AI
Round 4 - Behavioral 

(2 Questions)

  • Q1. High level design discussion
  • Q2. Design a load balancer
  • Ans. 

    Design a load balancer to evenly distribute incoming network traffic across multiple servers.

    • Implement a round-robin algorithm to distribute requests evenly among servers.

    • Monitor server health and adjust traffic distribution accordingly.

    • Use a combination of hardware and software load balancers for optimal performance.

    • Consider factors like server capacity, latency, and geographic location when routing traffic.

    • Implement ...

  • Answered by AI
Round 5 - HR 

(2 Questions)

  • Q1. Culture fit and salary negotiations
  • Q2. Why do you want to join licious.

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn leetcode medium questions and focus on LLD

Skills evaluated in this interview

Software Development Engineer II Interview Questions Asked at Other Companies

asked in Zepto
Q1. Given 2 large numeric comma seperated strings. You need to calcul ... read more
asked in Zepto
Q2. How many microservices do I own & at what scale they handle t ... read more
asked in Porter
Q3. 1. Given an array find a subset that sums to a given sum K 2. Giv ... read more
Q4. design a LLD of portfolio management system where you can add any ... read more
asked in S&P Global
Q5. Difference between truncate and delete and when we prefer what op ... read more

Software Development Engineer II Jobs at Licious

View all

Interview questions from similar companies

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. They asked 3 Coding questions and 5 MCQ all of them were very simple. One was related to fibbonaci. Another one was like there was 2d array and at i,j sum till row i and sum till j was given and all the el...

Interview Preparation Tips

Interview preparation tips for other job seekers - I got all three questions correct and also I got a call from recruiter saying that be prepared for interview at tuesday but when i tried calling, He wasn't picking it up. Overall, It was a pathetic experience.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.

Round 1 - Coding Test 

Frontend assement on react js functionality problems

Interview experience
3
Average
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.

Round 1 - Coding Test 

Basics of Frontend development and project discussion

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Code postorder traversal without using recursion.
  • Ans. 

    Iterative solution using a stack to perform postorder traversal.

    • Use a stack to simulate the recursive call stack.

    • Push nodes in the order of right, left, root.

    • Pop nodes from stack and add to result array.

    • Repeat until stack is empty.

  • Answered by AI
  • Q2. Leetcode Problem 1626 - Best team with no conflicts.
Round 2 - System Design 

(2 Questions)

  • Q1. Design whatsapp with one to one, group messaging and read receipts functionalities. Design the database.
  • Ans. 

    Design a messaging app like WhatsApp with one-to-one, group messaging, and read receipts functionalities.

    • Use a relational database to store user information, messages, and group memberships.

    • Create tables for users, messages, groups, and group memberships.

    • Include columns for message content, sender, receiver, timestamp, and read status.

    • Implement a feature to mark messages as read with read receipts.

    • Use indexes for effic

  • Answered by AI
  • Q2. Questions on dbms, cn and os.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Technical 

(2 Questions)

  • Q1. LRU Cache - how to tackle
  • Ans. 

    LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.

    • Implement using a doubly linked list and a hashmap for efficient operations

    • When an item is accessed, move it to the front of the list

    • When the cache is full, remove the least recently used item from the end of the list

  • Answered by AI
  • Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

3D DP, DP ON BST, Focus on highlevel dp and system design

I was interviewed in Mar 2022.

Round 1 - Face to Face 

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

  • Q1. 

    Unique Binary Search Trees Problem Statement

    Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...

  • Ans. 

    The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.

    • Use dynamic programming to solve the problem efficiently.

    • The number of structurally unique BSTs can be calculated using Catalan numbers.

    • For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

    • Example: For N=3, the number of structurally unique BSTs is 5.

  • Answered by AI
  • Q2. 

    Subsequences of String Problem Statement

    You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...

  • Ans. 

    Generate all possible subsequences of a given string.

    • Use recursion to generate all possible subsequences by including or excluding each character in the string.

    • Maintain a current index to keep track of the characters being considered.

    • Append the current character to each subsequence generated so far.

    • Recursively call the function with the next index to include or exclude the next character.

    • Base case: When the current ind...

  • Answered by AI
Round 3 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - Dynamic Programming, Basic OOPS, Commonly Asked Algorithms (Kadane’s, Dutch National Flag and more), Data Structures (Heaps, Stack, Queues, HashMaps and more), Low Level Design (Machine Coding)Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly

Application resume tips for other job seekers

Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Licious Interview FAQs

How many rounds are there in Licious Software Development Engineer II interview?
Licious interview process usually has 4 rounds. The most common rounds in the Licious interview process are Technical, Resume Shortlist and Behavioral.
How to prepare for Licious Software Development Engineer II interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Licious. The most common topics and skills that interviewers at Licious expect are Java, AWS, Algorithms, MVVM and NoSQL.
What are the top questions asked in Licious Software Development Engineer II interview?

Some of the top questions asked at the Licious Software Development Engineer II interview -

  1. Design a recommendation engi...read more
  2. Design a load balan...read more
  3. Scenario based questions like How did you handle a situation where your colleag...read more

Recently Viewed

SALARIES

Apple

INTERVIEWS

Licious

No Interviews

DESIGNATION

INTERVIEWS

Xiaomi

No Interviews

SALARIES

Godrej & Boyce Manufacturing

INTERVIEWS

Xiaomi

No Interviews

SALARIES

Apple

INTERVIEWS

Licious

No Interviews

SALARIES

Haier Appliances India

INTERVIEWS

Licious

No Interviews

Tell us how to improve this page.

Licious Software Development Engineer II Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more
Licious Software Development Engineer II Salary
based on 26 salaries
₹14 L/yr - ₹40 L/yr
At par with the average Software Development Engineer II Salary in India
View more details

Licious Software Development Engineer II Reviews and Ratings

based on 2 reviews

1.3/5

Rating in categories

1.3

Skill development

2.0

Work-life balance

2.3

Salary

1.0

Job security

1.3

Company culture

1.0

Promotions

1.3

Work satisfaction

Explore 2 Reviews and Ratings
SDE 2 - React Native

Bangalore / Bengaluru

3-5 Yrs

₹ 21-40 LPA

Explore more jobs
HUB Manager
109 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
101 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Executive
36 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Executive Production
36 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Territory Sales Manager
32 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Licious with

BigBasket

3.9
Compare

FreshToHome

3.5
Compare

ZappFresh.com

3.0
Compare

Blinkit

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview