Lowe's Interview Questions and Answers for Freshers

Create dynamic buttons with JSON data, maintain active/inactive states, and show content on click

• Create buttons dynamically using JSON data

• Toggle between active and inactive states on click

• Display button content based on JSON data on click

Use quicksort algorithm to sort array in one loop

• Use quicksort algorithm to partition array and sort elements

• Choose a pivot element and rearrange elements around pivot in one loop

• Repeat process for subarrays until entire array is sorted

Remove the Kth node from the end of a singly linked list given the position 'K'.

• Traverse the list to find the length 'N' of the linked list.

• Calculate the position of the node to be removed from the beginning as 'N - K + 1'.

• Traverse the list again and remove the node at the calculated position.

House Robber problem where adjacent houses have connected security system, find maximum money Mr. X can rob without triggering security.

• Use dynamic programming to keep track of maximum money robbed at each house.

• At each house, decide whether to rob the current house or skip it based on maximum money robbed so far.

• Handle the circular nature of houses by considering two cases: robbing the first house and not robbing the first house.

• Examples: For {2, 3, 2}, output is 3; for {1, ...read more

Graphs are used to represent relationships between objects. Shortest distance calculation is important in finding the most efficient path between two points.

• Graphs consist of nodes and edges that connect them.

• Shortest distance calculation can be done using algorithms like Dijkstra's algorithm or Bellman-Ford algorithm.

• Applications of graphs and shortest distance calculation include GPS navigation, network routing, and social network analysis.

Course scheduling problem involves assigning courses to students and professors based on availability and preferences.

• The problem involves matching courses with students and professors based on their availability and preferences.

• Constraints such as class size, room availability, and time slots must be taken into account.

• Optimization techniques such as linear programming and genetic algorithms can be used to solve the problem.

• Examples include scheduling classes for a universit...read more