Stashfin Software Developer Interview Questions and Answers

20 MCQs + 2 Coding Question

Q1. Trapping Rain Water
Add your answer

Q1. Questions on time and space complexity
Add your answer

Q1. General Discussion
Add your answer

Easy doable questions ( can be completed in 30 mins)

Q1. Basic DSA, OOPS, SQL questions
Add your answer

Q1. Complex and hard DSA problems( Dynamic programming questions) to be written on paper.
Add your answer

Medium Leetcode, Array, String, Tree, DP

Q1. System Design, Design Payment Platform
Add your answer

Mcqs based on cs fundamentals and 2_3 coding questions

Q1. 2-3 DSA questions to be written on paper in the interview itself
Add your answer
Q2. Merge 2 sorted Linked list into 1
Ans. 
Merge two sorted linked lists into one.
• Create a new linked list to store the merged list.

• Compare the values of the nodes from both lists and add the smaller value to the new list.

• Move the pointer of the list with the smaller value to the next node.

• Repeat the comparison and addition until one of the lists is empty.

• Add the remaining nodes from the non-empty list to the new list.

• Return the new merged list.
Answered by AI
Add your answer

Q1. A full cv analysis interview round discussion on all the projects and team work experience
Add your answer

Basic mathematics and analytical thinking questions

Basic programming questions

Q1. Be confident and speak casually
Add your answer
Q2. Basic questions depending on how u interact
Add your answer

Data Structures Algorithms

Data Structures and Algorithm

Round duration - 90 Minutes
Round difficulty - Medium

DS/Algo Questions 
2 questions

Q1. 
Hurdle Game Problem Statement
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...read more
Ans. 
The task is to determine the number of levels cleared by Kevin based on the total number of hurdles he has jumped.
• Each level 'i' has 'i' hurdles, so Kevin can only reach level 'i' if he has cleared level 'i-1'.

• Count the number of levels cleared by dividing the total number of hurdles by the sum of the first 'n' natural numbers.

• The formula to calculate the sum of the first 'n' natural numbers is (n * (n + 1)) / 2.
Answered by AI
Add your answer
Q2. 
Last Stone Weight Problem Explanation
Given a collection of stones, each having a positive integer weight, perform the following operation: On each turn, select the two heaviest stones and smash them toge...read more
Ans. 
This question is about finding the weight of the last stone after repeatedly smashing the two heaviest stones together.
• Sort the array of stone weights in descending order.

• Repeatedly smash the two heaviest stones together until there is at most 1 stone left.

• If there is 1 stone left, return its weight. Otherwise, return 0.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Live coding

Q1. 
Rearrange Odd and Even Position Nodes in Linked List
Rearrange a linked list such that all nodes at odd positions are together, followed by all nodes at even positions. You need to return the head of the ...read more
Ans. 
The task is to rearrange a linked list such that all odd position nodes are together and all even position nodes are together.
• Create two separate linked lists, one for odd position nodes and one for even position nodes.

• Traverse the original linked list and add the nodes to their respective lists based on their position.

• Join the two lists together by pointing the last node of the odd list to the head of the even list.

• Re...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. How would you design a system like Zomato?
Ans. 
Design Zomato - a food delivery platform
• Zomato is a platform that connects users with restaurants for food delivery

• Users can search for restaurants, view menus, and place orders

• Restaurants can register, manage their menus, and receive orders

• Delivery partners can sign up to deliver orders

• Payment integration is required for seamless transactions

• User reviews and ratings can be implemented for restaurant feedback

• Location-b...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Cultural

Round duration - 75 Minutes
Round difficulty - Medium

The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.

Q1. 
Flip Equivalent Binary Tree Problem
Determine whether two binary trees, given by their roots 'ROOT1' and 'ROOT2', are flip equivalent. A tree can be transformed into a flip equivalent through any number o...read more
Ans. 
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
• Perform a depth-first search (DFS) on both trees simultaneously

• At each node, check if the values are equal and the left and right subtrees are either both null or both not null

• If the above conditions are met, recursively check the flip equivalence of the left and right subtrees

• If any of the condition...read more
Answered by AI
Add your answer
Q2. 
Split Array Into Increasing Subsequences Problem Statement
You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if it is possible to split this array i...read more
Ans. 
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
• Check if the array can be split into increasing subsequences by iterating through the array.

• Keep track of the current subsequence and its length while iterating.

• If the difference between the current element and the previous element is not 1, start a new subsequence.

• If the length of any subseque...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.

Q1. 
Ninja and Alternating Largest Problem Statement
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
Example:
Input:
...read more
Ans. 
The task is to rearrange the given array such that every second element is greater than its left and right element.
• Iterate through the array and check if every second element is greater than its left and right element

• If not, swap the current element with its adjacent element to satisfy the condition

• Continue this process until the entire array satisfies the condition

• Return 1 if the array satisfies the condition, else re
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am