Lowe's India interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Lowe's India
3 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
I started my journey in coding from second year after being motivated from my seniors. I initially started my journey by learning basic programming languages. Later, I started giving contests on code forces and solving questions on it.
Application story
I got this opportunity through campus placements. Lowe's India visited our campus for internships and placements. I applied through my resume on their portal.
Why selected/rejected for the role?
I was able to solve almost all the questions asked me during the selection process. I have done a lot of coding practise on Competitive programming sites and built a deep understanding of programming skills. My good communication skills are also one reason of my selection.
Preparation
Duration: 6 months
Topics: Data Structures and Algorithms, Operating Systems, OOPS, Dynamic Programming,
Tip 1 : Practice atleast 30 questions of each topic of DSA
Tip 2 : Do practice OOPS thoroughly for the interview part. For the coding round practice arrays, strings, linked list and trees as much as you can.
Tip 3 : Make a blue print of Operating system note while preparing it and just revise it before your interview and coding round.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Make your resume short and try to make it of one page only
Tip 2 : mention all your skills which you are confident of in your resume.
Interview rounds
01
Round
Hard
Online Coding Test
Duration90 minutes
Interview date15 Mar 2019
Coding problem2
1. Find K’th Character of Decrypted String
Moderate
33m average time
0/80
Asked in companies
You have been given an Encrypted String where repetitions of substrings are represented as substring followed by the count of substrings.
Example: String "aabbbcdcdcd" will be encrypted as "a2b3cd3".
You need to find the 'K'th character of Decrypted String. Decrypted String would have 1-based indexing.
Note :
Input string will always be lowercase characters without any spaces.
If the count of a substring is 1 then also it will be followed by Integer '1'.
Example: "aabcdee" will be Encrypted as "a2bcd1e2"
This means it's guaranteed that each substring is followed by some Integer.
Also, the frequency of encrypted substring can be of more than one digit. For example, in "ab12c3", ab is repeated 12 times. No leading 0 is present in the frequency of substring.
The frequency of a repeated substring can also be in parts.
Example: "aaaabbbb" can also have "a2a2b3b1" as Encrypted String.
Problem approach
I have done this problem earlier so got the DP based approach during the test and this approach passed all the test cases.
2. DBMS Questions
We have data of employees of a company and we have to remove the duplicate entries of emails.
02
Round
Medium
Face to Face
Duration60 minutes
Interview date20 Mar 2019
Coding problem1
1. Positive Negative Pair
Easy
10m average time
90% success
0/40
Asked in companies
Given an array of distinct integers, find all the pairs having positive value and negative value of a number that exists in the array. Return the pairs in any order.
Note:
The pair consists of equal absolute values, one being positive and another negative.
Return an empty array, if no such pair exists.
Problem approach
I asked for some clarifications whether I should print all distinct x‘s or if I should print an x if a pair of +x and -x is encountered. The first approach I told was to use a map and I was keeping a flag for +x and -x if it’s found once. Later he asked me to print all pairs, so I stored the frequencies of all the elements in the map and iterated through the negative elements and for each element x , I would print x min(count[-x],count[+x]) times. He said he can’t afford that much space and he wanted me to optimise space further. So I told him a 2 pointer approach where I sort the array once and then keep two pointers to the start and end. I would move the start pointer forward if the sum is less than 0 and I’ll move the end pointer backward if the sum is greater than 0. He was fine with the solution and asked me to code it in a paper. I wrote the code and walked him through it.
03
Round
Easy
HR Round
Duration45 minutes
Interview date27 Apr 2023
Coding problem2
1. Basic HR Questions
Introduce yourself
Where do you see yourself in 5 years?
Problem approach
Tip 1 : Answers these ques like in upcoming years, I see myself as a knowledgeable professional in my company and will like to attain maximum growth.
2. Basic HR Questions
Mention your skill and weaknesses
Problem approach
Tip 1 : Answer this question like: I have a good problem-solving skill, which I consider as my biggest strength. And I am a curious person to learn the new technologies and doing work on challenging projects
Tip 2 : My strengths include an ability to work effectively as a part of team.
I am committed and focused towards the task I have been given.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by Lowe's India
Selected 
0 views
2 comments
0 upvotes
Software Engineer
3 rounds | 4 problems
Interviewed by Lowe's India
Selected 4228 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Lowe's India
Selected 2584 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3501 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
Selected 2410 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Amdocs
Selected 1985 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 5 problems
Interviewed by Optum
Selected 2175 views
0 comments
0 upvotes