Stashfin Interview Questions and Answers

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. All your experiences?
Add your answer
Q2. One match question percentage and all
Add your answer

Q1. Canstemer development
Add your answer
Q2. Barin wash castmer
Add your answer
Q3. Fainal tha costamer willing
Add your answer

Technical round 2 questions