LetsDressUp Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 50 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
Ans. 
Implement a Trie data structure with insert and search functions.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert function to add words by iterating through characters.

• Implement search function to check if a word exists by traversing the Trie.

• Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Answered by AI
Add your answer

HR told about the company on the first day, how it works, told the rules, showed the management and a lot

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

Q1. 
Remove Duplicates from a Sorted Linked List
Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.
You are given the 'Head' of a sorted linked list. Modify the l...read more
Ans. 
Remove duplicates from a sorted linked list without adjacent duplicates.
• Traverse the linked list while comparing current and next nodes.

• If they are equal, skip the next node by updating the current node's next pointer.

• Repeat until the end of the list is reached.
Answered by AI
Add your answer
Q2. 
Course Schedule Problem Statement
You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.
Some courses have prerequisites, which means that to take course i,...read more
Ans. 
Check if it is feasible to complete all courses with prerequisites.
• Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

• Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

• If there is no cycle, then it is feasible to complete all courses.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

Q1. 
LCA of Binary Tree Problem Statement
You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.
The LC...read more
Ans. 
Find the Lowest Common Ancestor of two nodes in a binary tree.
• Traverse the binary tree to find the paths from the root to nodes X and Y.

• Compare the paths to find the last common node, which is the Lowest Common Ancestor.

• Implement a recursive function to efficiently find the LCA.

• Handle cases where one node is an ancestor of the other.

• Consider edge cases like when X or Y is the root node.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

Q1. 
Binary Search Tree Iterator Problem Statement
Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...read more
Ans. 
Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).
• Implement a parameterized constructor to initialize the iterator with the root of the BST.

• Implement a method 'next()' to return the next smallest element in in-order traversal.

• Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

• Ensure the output is the in-order traversal of the
Answered by AI
Add your answer
Q2. 
Maximum Consecutive Ones Problem Statement
Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...read more
Ans. 
Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.
• Iterate through the array and keep track of the current window of 1's and zeroes.

• Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

• Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

• Return the maximum length ...read more
Answered by AI
Add your answer
Q3. 
BFS in Graph Problem Statement
You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...read more
Ans. 
BFS traversal of an undirected and disconnected graph starting from vertex 0.
• Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

• Use a queue to keep track of nodes to visit next.

• Keep a visited array to avoid revisiting nodes.

• Print the BFS traversal path as the nodes are visited.

• Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].
Answered by AI
Add your answer
Q4. 
Dijkstra's Shortest Path Problem Statement
Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...read more
Ans. 
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.
• Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

• Use a priority queue to efficiently select the next node with the shortest distance.

• Initialize distances to all nodes as infinity, except for the source node which is 0.

• Update distances t...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

Q1. 
First Non-Repeating Character Problem Statement
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...read more
Ans. 
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
• Iterate through the string to count the frequency of each character

• Iterate through the string again to find the first character with frequency 1

• If no such character is found, return the first character of the string
Answered by AI
Add your answer