LimeRoad Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

Algorithm and Data Structures. MCQ based on dbms, html, css, js, sql, oops, program output.

Q1. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
The task is to determine if a given string of parentheses is balanced or not.
• Iterate through each character in the string and use a stack to keep track of opening parentheses

• If a closing parenthesis is encountered, check if it matches the top of the stack. If not, the string is not balanced

• If all parentheses are matched correctly and the stack is empty at the end, the string is balanced
Answered by AI
Add your answer
Q2. 
Group Anagrams Problem Statement
Given an array or list of strings called inputStr, your task is to return the strings grouped as anagrams. Each group should contain strings that are anagrams of one anoth...read more
Ans. 
Group anagrams in an array of strings based on their characters.
• Iterate through each string in the input array

• Sort the characters of each string and use the sorted string as a key in a hashmap to group anagrams

• Return the values of the hashmap as the grouped anagrams
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Algorithm and Data Structures. Sql queries insert and update commands.

Q1. 
Buy and Sell Stock - III Problem Statement
Given an array prices where the i^th element represents the price of a stock on the i^th day, your task is to determine the maximum profit that can be achieved at ...read more
Ans. 
Determine the maximum profit that can be achieved by selling stocks with at most two transactions.
• Iterate through the array and calculate the maximum profit that can be achieved by selling stocks at each day.

• Keep track of the maximum profit after the first transaction and the maximum profit after the second transaction.

• Return the maximum profit that can be achieved overall.
Answered by AI
Add your answer
Q2. 
Word Ladder Problem Statement
Given two strings, BEGIN and END, along with an array of strings DICT, determine the length of the shortest transformation sequence from BEGIN to END. Each transformation inv...read more
Ans. 
The Word Ladder problem involves finding the shortest transformation sequence from one word to another by changing one letter at a time.
• Use breadth-first search to find the shortest transformation sequence.

• Create a graph where each word is a node and words that can be transformed into each other are connected.

• Keep track of visited words to avoid cycles and optimize the search process.

• Return -1 if no transformation sequ...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Some questions related to html and css. What are the various selector in css. SQL queries on how to use group by and having. Difference between truncate and delete.

Q1. 
Problem: Ninja's Robot
The Ninja has a robot which navigates an infinite number line starting at position 0 with an initial speed of +1. The robot follows a set of instructions which includes ‘A’ (Acceler...read more
Ans. 
Determine the minimum length of instruction sequence for a robot to reach a given target on an infinite number line.
• Start at position 0 with speed +1, update position and speed based on 'A' and 'R' instructions

• For each test case, find the shortest sequence of instructions to reach the target

• Consider both positive and negative positions for the robot

• Return the minimum length of instruction sequence for each test case
Answered by AI
Add your answer