AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Lowe's Java Developer Interview Questions and Answers
Lowe's Java Developer Interview Experiences
1 interview found
Anonymous
I applied via Referral and was interviewed in Dec 2024. There were 2 interview rounds.
(2 Questions)
- Q1. Kafka , heap stack
- Q2. Mvc endpoint creation
(2 Questions)
- Q1. Dsa on string please
- Ans.
Data structures and algorithms related to string manipulation in Java.
Use built-in methods like indexOf(), substring(), and charAt() for string manipulation.
Implement algorithms like string reversal, palindrome check, and string matching using DSA concepts.
Consider using data structures like arrays, hashmaps, and linked lists for efficient string operations.
- Q2. Heap
Interview Preparation Tips
2. technical discussion -> 1 dsa question, related to project, heap/stack memory, design pattern
Interview questions from similar companies
I appeared for an interview 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 appeared for an interview 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
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 Naukri.com and was interviewed in Aug 2024. There were 2 interview rounds.
30mins good easy 2 problems
Prepare dsa and focus on coind
Aniket Batabyal
Basic javascript dsa questions
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
I appeared for an interview 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
2 qns. Dp and backtracking. Problems were medium level.
(1 Question)
- Q1. Sql, big data, one coding question , os concepts.
(1 Question)
- Q1. How will u see you after 5 years. Why walmart. Is sql better or firebase better.
Interview Preparation Tips
I applied via Job Fair and was interviewed in Aug 2023. There were 2 interview rounds.
(37 Questions)
- Q1. What is your name?
- Q2. My is gurasala bhoomika
- Q3. What is your hobbies?
- Q4. Watching TV, listing music
- Q5. Explain finally year study?
- Q6. I have studying audisankara institute of technology in guduru
- Q7. Explain about intermediate ?
- Ans.
Intermediate refers to a level of proficiency or knowledge that falls between beginner and advanced.
Intermediate level typically involves a deeper understanding of concepts and the ability to apply them in practical scenarios.
Individuals at an intermediate level may have some experience in the field but still have room for growth and learning.
Examples of intermediate skills include proficiency in a programming language...
- Q8. I have completed my intermediate in Narayanganj junior college in tirupati
- Q9. Explain about ur SCC ?
- Ans.
SCC stands for Source Code Control. It is a system used to manage and track changes to source code files.
SCC helps developers collaborate on code by providing version control and tracking changes.
Popular SCC tools include Git, SVN, and Mercurial.
SCC allows developers to revert to previous versions of code, track changes made by team members, and merge code changes seamlessly.
SCC helps in maintaining code integrity and ...
- Q10. I have studied in nice English medium school In VarAdaiahpalem
- Q11. What is your favourite colour ?
- Q12. Who is your favourite teacher?
- Q13. My favourite teacher is prasanna sir
- Q14. What is your short term goal?
- Q15. I want become a software developer
- Q16. What is achievement?
- Q17. I have got prices in 8 th
- Q18. Which topic do you get?
- Q19. Story telling topic
- Q20. What is ur strength ?
- Ans.
My strength lies in my problem-solving skills and ability to learn quickly.
Strong problem-solving skills
Quick learner
Adaptability to new technologies
Ability to work well under pressure
- Q21. My knowledge is my power Communication skills Smart work
- Q22. What can support you?
- Ans.
Support from my team, access to resources, clear communication
Support from my team helps me stay motivated and overcome challenges
Access to resources such as training materials and tools enables me to perform my job effectively
Clear communication ensures that I understand project requirements and expectations
- Q23. My teachers,my brother
- Q24. What is popular temple in ur village?
- Ans.
The popular temple in my village is the Sri Ranganathaswamy Temple.
Located in the heart of the village
Dedicated to Lord Ranganatha
Annual festivals and rituals attract devotees from neighboring villages
- Q25. The popular temple is god shiva
- Q26. How many languages do know?
- Ans.
I am proficient in 5 programming languages including Java, Python, C++, JavaScript, and SQL.
Java
Python
C++
JavaScript
SQL
- Q27. I know Telugu, hindi
- Q28. What is the best in you?
- Q29. I can do smart work
- Q30. Why want hire you?
- Q31. I can communicate with people well manner
- Q32. What is the best memory in frist year?
- Q33. My birthday can do well
- Q34. What much salary expectations?
- Q35. I expections 4000
- Q36. What can do frist salary?
- Q37. I enjoy my self.i go to my parents
Skills evaluated in this interview
Lowe's Interview FAQs
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
- Senior Java Developer Interview Questions
- Junior Java Developer Interview Questions
- Java Software Developer Interview Questions
- Java Developer Trainee Interview Questions
- Java Software Engineer Interview Questions
- Associate Java Developer Interview Questions
- Java J2ee Developer Interview Questions
- Software Developer Interview Questions
- Show more
Lowe's Java Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
Lowe's Java Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Software Engineer
1.1k
salaries
|  ₹7.7 L/yr - ₹27 L/yr |
|
Senior Software Engineer
1k
salaries
| ₹11.9 L/yr - ₹40 L/yr |
|
Senior Analyst
245
salaries
| ₹7 L/yr - ₹25 L/yr |
|
Analyst
234
salaries
| ₹5 L/yr - ₹16.8 L/yr |
|
Lead Software Engineer
169
salaries
| ₹18 L/yr - ₹60 L/yr |
Home Depot
Ace Hardware
Menards
Sherwin Williams Paints
- Home >
- Interviews >
- Lowe's Interview Questions >
- Lowe's Java Developer Interview Questions
