Bluestock ™ Software Development Engineer Interview Questions and Answers

3 dsa questions medium level

Q1. 2 medium level dp questions based on string and stocks
Add your answer
Q2. One hard question based on graph
Add your answer

Q1. Hr questions and java , springboot questions etc
Add your answer

Three fundamental questions related to Data Structures and Algorithms.

Test was based on arrays and some dsa concepts.

Q1. 2Sum DSA leetcode problem
Ans. 
2Sum problem involves finding two numbers in an array that add up to a specific target.
• Use a hashmap to store the difference between the target and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Return the indices of the two numbers that add up to the target.
Answered by AI
Add your answer
Q2. Spiral traversal of a Binary tree
Ans. 
Spiral traversal of a Binary tree involves visiting nodes level by level alternating between left to right and right to left.
• Start by pushing the root node into a queue.

• While the queue is not empty, pop a node, print its value, and push its children into the queue.

• Alternate between popping nodes from the queue and printing their values in a spiral manner.
Answered by AI
Add your answer

Q1. A problem similar to coin change problem of leetcode
Add your answer
Q2. Aggressive cows problem
Ans. 
The aggressive cows problem involves finding the maximum distance between cows in a field while ensuring they are not too close to each other.
• Use binary search to find the maximum distance between cows.

• Sort the cows' positions and check if a certain distance is feasible.

• Consider the constraints of the problem such as the number of cows and the size of the field.
Answered by AI
Add your answer

Q1. Basic behavioural questions like why I am looking for a change and would I be able to handle the increased work pressure as I was shifting from MNC to a startup
Add your answer

Q1. Design and implement LRU cache?
Ans. 
LRU cache is a data structure that maintains the least recently used items in memory for efficient access.
• Use a combination of a doubly linked list and a hashmap to store and access the cache items.

• When a new item is accessed, move it to the front of the linked list to mark it as the most recently used.

• If the cache is full, remove the least recently used item from the end of the linked list and the hashmap.
Answered by AI
Add your answer

Coding and aptitude round

Q1. Tree dsa questions
Add your answer

Q1. Horse race question
Add your answer

Q1. Location specific question
Add your answer

Q1. Projects, previous work , dsa and database
Add your answer

Q1. System design , dsa
Add your answer

Q1. Behavioural, system design
Add your answer

Q1. General discussion , salary
Add your answer