Limechat Software Developer Intern Interview Questions and Answers

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

Q1. 
Print the Kth Digit
Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).
Input:
The first line contains ...read more
Ans. 
The task is to find the Kth digit from the right in the number obtained from N raised to the power M.
• Iterate through the digits of N^M from right to left

• Keep track of the position of the current digit

• Return the digit at position K from the right
Answered by AI
Add your answer
Q2. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. 
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
• Iterate through the buildings and create a list of critical points (x, y) where the height changes.

• Sort the critical points based on x-coordinate and process them to form the skyline.

• Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

• Return the fin...read more
Answered by AI
Add your answer
Q3. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Identify the longest palindromic substring in a given string.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found

• Return the longest palindrome with the smallest start index
Answered by AI
Add your answer

Easy leetcode code 2 questions , HTML5 css javascript simple screen design

Q1. Oop, Simple coding javascript, react basic, sql basic
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).

Q1. 
Minimum Jumps Problem Statement
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...read more
Ans. 
Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.
• Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.

• Keep track of the visited shops to avoid revisiting them.

• If a shop has an Arr value of 0, it is impossible to reach the final shop.

• Return -1 if the final shop cannot be reached.
Answered by AI
Add your answer
Q2. 
Smallest Window Problem Statement
Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.
Example:
Input:
S = "abdd", X = "bd"
Outpu...read more
Ans. 
Find the smallest substring in S that contains all characters in X.
• Use a sliding window approach to find the smallest window in S containing all characters of X.

• Maintain a hashmap to keep track of characters in X and their frequencies in the current window.

• Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.

• Return the smallest window found.

• Example: S = 'abd
Answered by AI
Add your answer
Q3. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from start to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Return paths in alphabetical order as a list of strings.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS were asked in this round.

Q1. What is a virtual function?
Ans. 
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
• Virtual functions allow for dynamic polymorphism in C++

• They are used in inheritance to achieve runtime polymorphism

• Virtual functions are declared in a base class and can be overridden in derived classes

• They are called based on the type of object bei...read more
Answered by AI
Add your answer
Q2. What are the types of polymorphism in Object-Oriented Programming?
Ans. 
Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.
• Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

• Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.

• Polymor...read more
Answered by AI
Add your answer
Q3. What is the difference between deep copy and shallow copy?
Ans. 
Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.
• Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

• In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.