AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Lowe's Full Stack Developer Interview Questions and Answers
Lowe's Full Stack Developer Interview Experiences
1 interview found
Anonymous
I was interviewed in Jun 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
Explain Higher Order Functions in javascript.
What is the difference between tag and tag?
- Q1.
Sort Array of Strings Problem Statement
Given an array of strings
ARRSTR[]of sizeN, and a characterC, your task is to sort theARRSTR[]array according to a new alphabetical order that starts with the ... - Ans.
Sort an array of strings based on a new alphabetical order starting with a given character.
Iterate through the array of strings and compare each string based on the new alphabetical order starting with the given character.
Implement a custom sorting function that considers the new alphabetical order.
Return the sorted array of strings.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
List the different types of relationships in SQL.
What is an Alias in SQL?
- Q1.
Relative Sorting Problem Statement
You are given two arrays, 'ARR' of size 'N' and 'BRR' of size 'M'. Your task is to sort the elements of 'ARR' such that their relative order matches that in 'BRR'. Any e...
- Ans.
Sort elements of ARR to match relative order in BRR, append missing elements at the end in sorted order.
Create a hashmap to store the index of elements in BRR for quick lookup.
Sort elements in ARR based on their index in BRR, append missing elements at the end.
Handle edge cases like empty arrays or duplicate elements in ARR and BRR.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
Excel Sheet Column Number Problem Statement
You are provided with a string
STRrepresenting a column title in an Excel Sheet. Your task is to determine the corresponding column number.Example:
A typica...
- Ans.
Convert Excel sheet column title to corresponding column number.
Iterate through the characters in the string from right to left, starting with a result of 0.
For each character, calculate its value by subtracting 'A' and adding 1, then multiply by 26 raised to the power of its position from the right.
Add up all the calculated values to get the final column number.
Example: For input 'AB', A=1, B=2, so result = (1 * 26^1)
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1. Why do you want to join Lowe's?
Interview Preparation Tips
Tip 1 : Consistent
Tip 2 : Keep practicing
Tip 3 : Keep on giving interview
Tip 1 : Mention All Skills
Tip 2 : One page resume enough
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
There were 2 coding questions given in this round. One was related to Dynamic Programming and the second one was related to Recursion and Number Theory.
- Q1.
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
- Ans.
House Robber problem where a robber wants to maximize stolen money without robbing adjacent houses in a circular street.
Use dynamic programming to keep track of maximum stolen money at each house.
Consider two cases: either rob the current house and skip the next, or skip the current house.
Handle circular arrangement by considering the first and last houses separately.
Example: For arr[] = {2, 3, 2}, the output is 3. Rob...
- Q2.
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows:
F(n) = F(n-1) + F(n-2), with initial conditionsF(1) = F(2) = 1.Input:
... - Ans.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round where I was given 2 questions to solve , one was from Linked List and the other was related to Priority Queue / Quick Sort .
- Q1.
Intersection of Linked Lists Problem Statement
You are provided with two linked lists,
L1andL2, both sorted in ascending order. Generate a new linked list containing elements that exist in both linked l... - Ans.
Given two sorted linked lists, find the intersection of elements in both lists and return a new sorted linked list.
Traverse both linked lists simultaneously to find common elements
Create a new linked list to store the intersecting elements
Ensure the final linked list is sorted in ascending order
Handle cases where there are no common elements between the lists
- Q2.
Kth Largest Element Problem Statement
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
Input:
The first line contains an integer 'T... - Ans.
Find the Kth largest element in a given list of numbers.
Sort the array in descending order.
Return the Kth element from the sorted array.
Handle multiple test cases efficiently.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Easy
This round majorly focused on Real life appications of Data Structures and also revolved around Object Oriented Programming Style of writing code .
- Q1.
Data Structure with Insert, Delete, and GetRandom Operations
Design a data structure that supports four operations: insert an element, remove an element, search for an element, and get a random element. E...
- Ans.
Design a data structure with insert, delete, search, and getRandom operations, all in constant time.
Use a combination of HashMap and ArrayList to achieve constant time operations.
For insert operation, add the element to the ArrayList and store its index in the HashMap.
For delete operation, swap the element to be deleted with the last element in the ArrayList, update the index in the HashMap, and then remove the last el...
- Q2.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accesse
(2 Questions)
Round duration - 45 Minutes
Round difficulty - Medium
This round was inclined towards some Low Level Design Principles and some concepts from Java .
- Q1. Design a Railway Reservation System.
- Ans.
Design a Railway Reservation System
Create a database to store train schedules, seat availability, and passenger information
Implement a user interface for users to search for trains, book tickets, and view their reservations
Include features like seat selection, payment processing, and ticket confirmation
Handle scenarios like waitlisting, cancellations, and refunds
Ensure data security and privacy of passenger information
- Q2. Why is Java considered platform-independent while the Java Virtual Machine (JVM) is platform-dependent?
- Ans.
Java is platform-independent because the code is compiled into bytecode that can run on any platform with a JVM, which is platform-dependent due to its reliance on the underlying hardware and operating system.
Java code is compiled into bytecode, which can run on any platform with a JVM.
JVM acts as an interpreter that translates bytecode into machine code specific to the underlying hardware and operating system.
The JVM ...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 90 Minutes
Round difficulty - Medium
This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.
- Q1.
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...
- Ans.
Find the minimum cost to buy a specific weight of oranges using given cost list.
Iterate through the cost list and find the minimum cost to achieve the desired weight
Keep track of the minimum cost while considering available packet weights
Return -1 if it is not possible to buy exactly W kg of oranges
- Q2.
K - Sum Path In A Binary Tree
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...
- Ans.
Find all paths in a binary tree where the sum of node values equals a given value 'K'.
Traverse the binary tree using DFS and keep track of the current path and its sum.
At each node, check if the current sum equals 'K' and add the path to the result if true.
Continue traversal to the left and right child nodes recursively.
Return the list of paths that sum up to 'K'.
(2 Questions)
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on puzzles and some questions revolving around Computer Networks and the projects in my resume .
- Q1. You have two wires of different lengths that take different times to burn. How can you measure a specific amount of time using these two wires?
- Ans.
Use two wires of different lengths to measure a specific amount of time by burning them simultaneously.
Burn both wires at the same time, one wire will burn faster than the other.
Measure the time it takes for the faster burning wire to completely burn.
Calculate the specific amount of time by using the ratio of the lengths of the two wires.
- Q2. You have 3 ants located at the corners of a triangle. The challenge is to determine the movement pattern of the ants if they all start moving towards each other. What will be the outcome?
(2 Questions)
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
- Q1. What do you know about the company?
- Q2. Why should we hire you?
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This was a proctured online coding round where we had 2 questions to solve under 90 minutes . The questions were of easy to medium level I would say with some lenghty implementations .
- Q1.
Minimum Numbers Required Problem Statement
Given an array
'ARR'consisting ofNintegers, along with two integers,'SUM'and'MAXVAL', you need to determine the minimum number of integers to be added to t... - Ans.
Determine the minimum number of integers to be added to an array to make its sum equal to a given value.
Iterate through the array and calculate the current sum.
Determine the difference between the target sum and the current sum.
Add the minimum number of integers within the range of -MAXVAL to MAXVAL to reach the target sum.
- Q2.
Maximum Sum Subsequence Problem Statement
Given an array of integers
NUMSconsisting ofNintegers and an integerK, determine the maximum sum of an increasing subsequence with exactlyKelements.Exampl...
- Ans.
Find the maximum sum of an increasing subsequence with exactly K elements in an array of integers.
Iterate through the array and maintain a dynamic programming table to store the maximum sum of increasing subsequences ending at each index.
For each element, check all previous elements to find the increasing subsequence with maximum sum ending at that element.
Update the dynamic programming table with the maximum sum found...
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to
pass this round with ease.
- Q1.
Check Whether Binary Tree Is Complete
You have been given a binary tree and your task is to determine if it is a Complete Binary Tree or not.
A Complete Binary Tree is defined as a binary tree where ever...
- Ans.
Check if a binary tree is a Complete Binary Tree or not based on given criteria.
Traverse the binary tree level by level and check if all levels are completely filled except the last one.
Ensure all nodes at the last level are positioned at the leftmost side.
Use level order traversal to check for completeness of the binary tree.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the output should be 1.
- Q2.
Consecutive Elements
Given an array
arrofNnon-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.Input:
The first line of inp... - Ans.
Check if an array of integers consists of consecutive numbers.
Iterate through the array and check if the absolute difference between consecutive elements is 1.
Sort the array and check if the elements are consecutive.
Use a set to store the elements and check if the size of the set is equal to the length of the array.
(2 Questions)
Round duration - 40 Minutes
Round difficulty - Medium
This round majorly focused on my projects and some standard questions revolving around Operating Systems and DBMS.
- Q1. How can you print numbers from 1 to 100 using more than two threads in an optimized approach?
- Ans.
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
Divide the range of numbers (1-100) among the threads to avoid duplication.
Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.
Consider using a shared data structure like a queue to coordinate the threads.
Implement a mechanism to signal the threads when to start and stop printing.
- Q2. What are the advantages of using views in a database management system?
- Ans.
Views in a database management system provide data security, simplify complex queries, and improve performance.
Enhanced security by restricting access to certain columns or rows
Simplify complex queries by pre-defining joins and filters
Reduce redundancy by storing commonly used queries as views
Improve performance by storing pre-processed data in views
Allow for data abstraction, making it easier to work with complex data
(2 Questions)
Round duration - 30 Minutes
Round difficulty - Easy
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
- Q1. What do you know about the company?
- Q2. Why should we hire you?
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Selected
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
It was a combination of mcq and coding questions
mcq: aptitude + c++ + sql question, nothing really tough
Coding question: 3 leetcode question, medium level, of stack, binary search and graph traversal
(5 Questions)
- Q1. Question regarding project
- Q2. SQL basic to moderate question
- Q3. C++ coding question on strings recursion callback in c, oops medium level question, finding error in code
- Q4. Puzzles Q1-> cake cutting ( 3 cuts, 8 slices) Q2 ->9 bottles, 8 same weight bottles, 1 heavy, 2 tries using a balance
- Q5. OS question difference bw multi-processing and multi-programming how would u reduce number of page faults. etc
(3 Questions)
- Q1. Once again project explanation
- Q2. Basic to high level oops question:( C++) i was asked to write some class and in that these questions were asked 1: different types of access modifiers, but the question was asked indirectly. like why did...
- Q3. HR questions, since it was a semi technical cum hr round,
Interview Preparation Tips
I applied via Campus Placement
2 coding questions and a few MCQs
(1 Question)
- Q1. Asked to explain and optimise my solution from coding test
(1 Question)
- Q1. Behavioral round. Asked about resume.
(1 Question)
- Q1. General HR round and trying to find if you're a right fit for the company
The test was quite simple but the interviewer was not ready to accept the solution. Even with complete dry run and working output he denied the solution giving a very vague reason.
(1 Question)
- Q1. In this design round , they asked me to demonstrate how to build cowin app. Gave a complete overview including HLD and LLD for each showcased feature still got negative response.
Interview Preparation Tips
(1 Question)
- Q1. Coding round related to Android
(1 Question)
- Q1. Current project in detail
(2 Questions)
- Q1. Related to project
- Q2. Deployment and maintenance
SUBHAM BANERJEE
Selected
I applied via LinkedIn and was interviewed before Jan 2024. There was 1 interview round.
(1 Question)
- Q1. Simple domain related knowledge and design some basic project
Lowe's Interview FAQs
Recently Viewed
REVIEWS
Consulting Engineers Group
No Reviews
JOBS
SAP
No Jobs
LIST OF COMPANIES
SAP
Locations
REVIEWS
SAP
No Reviews
JOBS
DMart
No Jobs
JOBS
SAP
No Jobs
LIST OF COMPANIES
Lowe's
Locations
JOBS
Lowe's
No Jobs
JOBS
DMart
No Jobs
JOBS
Lowe's
No Jobs
Tell us how to improve this page.
Lowe's Interviews By Designations
- Lowe's Software Engineer Interview Questions
- Lowe's Senior Software Engineer Interview Questions
- Lowe's Associate Software Engineer Interview Questions
- Lowe's Software Developer Interview Questions
- Lowe's Analyst Interview Questions
- Lowe's Data Analyst Interview Questions
- Lowe's Senior Analyst Interview Questions
- Lowe's Senior Data Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Full Stack Software Developer Interview Questions
- Senior Full Stack Developer Interview Questions
- Java Full Stack Developer Interview Questions
- Mern Full Stack Developer Interview Questions
- Full Stack Engineer Interview Questions
- Full Stack Web Developer Interview Questions
- Php Full Stack Developer Interview Questions
- full stack .net developer Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
Software Engineer
1k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
965
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Analyst
230
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Analyst
221
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Lead Software Engineer
150
salaries
| ₹0 L/yr - ₹0 L/yr |
Home Depot
Ace Hardware
Menards
Sherwin Williams Paints
- Home >
- Interviews >
- Lowe's Interview Questions >
- Lowe's Full Stack Developer Interview Questions
