Licious Software Development Engineer II Interview Questions and Answers

Frontend assement on react js functionality problems

Basics of Frontend development and project discussion

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
Add your answer
Q2. Leetcode Problem 1626 - Best team with no conflicts.
Add your answer

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
Add your answer
Q2. Questions on dbms, cn and os.
Add your answer

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
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

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

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 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...read more
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
Add your answer
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...read more
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...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions