Licious SDE-2 Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

- It was a face to face (virtually) round.
- Two questions one after one and you are expected to pass all the test cases.
- Question was Easy and Medium Easy. (tags: stack, array, bfs, dfs, array)

- Timing: Afternoon
- Interviewer: he was nice, as I was able to solve both question, he was very happy, and given me the feedback.

Q1. 
Remove Consecutive Duplicates from String
Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string.
...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, append the current character to the new string
Answered by AI
Add your answer
Q2. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.
• Iterate through each cell in the array

• If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells

• Increment the count of islands for each connected component found
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Medium

Machine Coding.

Timing: Afternoon
The interviewer was answering my questions nicely.

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.

The environment was cool.

Q1. Data Structures and Algorithms
Add your answer

Q1. Machine Coding round
Add your answer

Q1. Minimum cost to connect the ropes
Ans. 
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
• Sort the ropes in ascending order.

• Repeatedly connect the two smallest ropes.

• Add the cost of connecting the two ropes to the total cost.

• Continue this process until all ropes are connected.
Answered by AI
Add your answer
Q2. Max value of arr[i]+arr[j]+i-j
Ans. 
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
• Iterate through all possible pairs of i and j in the array

• Calculate the value of arr[i]+arr[j]+i-j for each pair

• Keep track of the maximum value found
Answered by AI
Add your answer

Q1. Map based easy question
Add your answer
Q2. Priority based heap question
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
Merge two sorted linked lists into a single sorted linked list without using additional space.
• Create a dummy node to start the merged list

• Compare the values of the two linked lists and add the smaller value to the merged list

• Move the pointer of the merged list and the pointer of the smaller value list

• Continue this process until one of the lists is fully traversed

• Append the remaining elements of the other list to the me...read more
Answered by AI
View 1 more answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

Q1. What is the event loop and what is its significance?
Ans. 
The event loop is a mechanism in programming that allows for asynchronous execution of code.
• The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

• It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

• The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...read more
Answered by AI
Add your answer
Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
Ans. 
Output-based questions in JavaScript using browser APIs
• Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

• Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

• Example 3: Develop a web page that uses the Canvas API to draw a simple animation
Answered by AI
Add your answer
Q3. How would you design a system to support localization in a mobile app?
Ans. 
Designing a system to support localization in a mobile app
• Use resource files to store localized strings for different languages

• Implement a language selection feature for users to choose their preferred language

• Utilize localization libraries or frameworks to streamline the process

• Consider cultural differences when localizing content, such as date formats and currency symbols
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
Ans. 
To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.
• Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

• Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

• Keep track of the results and compare the timings to d...read more
Answered by AI
Add your answer
Q2. How do you debug the root cause of lag on a screen?
Ans. 
To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.
• Analyze code to identify any inefficient algorithms or operations causing lag.

• Check for memory leaks that could be impacting performance.

• Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

• Use profiling tools like Xcode Instruments or Android Profiler to identify p...read more
Answered by AI
Add your answer
Q3. Can you explain the architecture of the app you have recently worked on?
Ans. 
The app I recently worked on is a social media platform for sharing photos and connecting with friends.
• The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

• The client side is built using React Native for cross-platform compatibility.

• The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

• The a...read more
Answered by AI
Add your answer