Lowe's Lead Software Engineer Interview Questions and Answers

3 sum problem was asked to complete

Take home project to design app

The assessment consisted of an online round lasting one hour, during which there were 33 questions, all of which were challenging, including the multiple-choice questions. The questions were divided into six subsections: 1. Data Structures and Algorithms (DSA) - with a problem related to dynamic programming or recursion; 2. Java; 3. Java 8; 4. Spring; 5. Spring Boot; 6. Microservices.

Q1. What is garbage collector in python
Ans. 
Garbage collector in Python is a built-in feature that automatically manages memory by reclaiming unused memory space.
• Garbage collector in Python helps in automatically deallocating memory of objects that are no longer in use.

• It prevents memory leaks by freeing up memory that is no longer needed.

• Python's garbage collector uses reference counting and a cycle-detecting algorithm to manage memory efficiently.
Answered by AI
Add your answer

Q1. Technical interview related to ooo
Add your answer

Graphs and arrays tricky questions

Q1. Reverse a linked list two sum indexin no sql vs sql access specifiers
Ans. 
The question is about reversing a linked list.
• Iterative approach: Use three pointers to reverse the links between nodes.

• Recursive approach: Recursively reverse the rest of the list and then fix the links.

• Example: Given a linked list 1 -> 2 -> 3 -> 4, the reversed list will be 4 -> 3 -> 2 -> 1.
Answered by AI
Add your answer

Q1. Strengths and weaknesses
Add your answer
Q2. Leadership qualities
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

This was the online round held at Hackerearth. All students who met the eligibility criteria were shared link for the online test on hackerearth.

Q1. 
Remove Consecutive Duplicates Problem Statement
Given a string str of size N, your task is to recursively remove consecutive duplicates from this string.
Input:
T (number of test cases)
N (length of the ...read more
Ans. Recursion
The idea is here to use recursion as mentioned in the problem statement. For each character either it will be included in the answer or not, how to decide this at each point?
We will compare the last and 2nd last character of the string each time if they are equal we will remove the last and call recursion for the remaining string, if they both are not equal then we will append the last character into our final...read more
Answered Anonymously
Add your answer
Q2. 
Deepest Leaves Sum Problem Statement
Given a binary tree of integers, your task is to calculate the sum of all the leaf nodes present at the deepest level of this binary tree. If there are no such nodes, ...read more
Ans. Find Deepest Level
The idea is pretty simple. First, we will find the deepest level of the given binary tree, say ‘maxDepth’. We can do this with a single traversal of the binary tree. 

After finding the deepest level of the binary tree, we will again traverse the given tree. Also, we will maintain a ‘sum’ and ‘currLevel’ variable for each node in the tree. Whenever the ‘currLevel’ which represents the level of the ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems.There were 2 interviewers. We first dicussed the approach the time complexity and proper code covering all cases.

Q1. 
Palindrome Permutation - Problem Statement
Determine if a permutation of a given string S can form a palindrome.
Example:
Input:
string S = "aab"
Output:
"True"
Explanation:
The permutation "aba" o...read more
Ans. Frequency Table
1. The idea behind this approach is that in a palindrome at max 1 character can have an odd frequency.
2. So in this approach, we calculate the frequency of each character of the given string and check if at most 1 character has an odd frequency. If more than one character will be having the odd frequency then the given string can not be converted into a palindrome.
3. Therefore, we create a frequency table, (say ‘...read more
Answered Anonymously
Add your answer
Q2. 
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an in...read more
Ans. Brute Force
The basic idea of this approach is to check each word of the given sentence ‘S’ if it matches with the given word ‘W’.

 
Consider the following steps:
1. Start iterating through each character of sentence string ‘S’ using a variable ‘i’ such that 0 <= ‘i’ < |S|
   • Create a string “temp” which stores the current word.
   • Add all the subsequent characters of the sentence till space is detected or if all end of th...read more
Answered Anonymously
Add your answer

Round duration - 30 mintues
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.