Lowe's Associate Software Engineer Interview Questions and Answers

I would choose a linked list as it allows for efficient insertion and deletion operations.

• Linked lists have constant time complexity for insertion and deletion operations

• Arrays have a linear time complexity for these operations

• Examples of linked list applications include implementing stacks and queues

• Arrays are better suited for random access and searching

Technical interview questions on Kafka, Microservices, HashMap, Stack and Stock

• To connect Kafka to Spring Boot project, add Kafka dependencies in pom.xml and configure Kafka properties in application.properties

• Microservices communicate with each other through REST APIs or message brokers like Kafka or RabbitMQ

• HashMap internally uses an array of buckets to store key-value pairs. Collision is resolved by chaining or open addressing

• To reverse a stack, use an auxiliary stack to p...read more

Finding index of target element in a rotated sorted array.

• Use binary search to find the pivot point where the array is rotated.

• Determine which half of the array the target element lies in.

• Perform binary search on the appropriate half to find the target element index.

Find the longest substring in a given string with no repeated characters.

• Use a sliding window approach to keep track of the current substring.

• Use a hash set to keep track of the characters in the current substring.

• If a repeated character is found, move the start of the window to the next character after the first occurrence of the repeated character.

• Update the maximum length of the substring as the window slides through the string.

Reverse the order of words in a given string.

• Split the string into an array of words using space as a delimiter.

• Reverse the array of words.

• Join the array of words back into a string using space as a separator.