i
Stashfin
Filter interviews by
I applied via Naukri.com and was interviewed before Nov 2023. There were 3 interview rounds.
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.
The coin change problem involves finding the number of ways to make a certain amount using given coin denominations.
Dynamic Programming Approach: Use an array to store the number of ways to make each amount up to the target.
Example: For coins [1, 2, 5] and target 5, ways are: 5 (1x5), 2+2+1, 2+1+1+1, 1+1+1+1+1.
Base Case: Initialize dp[0] = 1, as there's one way to make 0 amount (using no coins).
Iterate through each coi...
Top trending discussions
I appeared for an interview in Mar 2025, where I was asked the following questions.
Split an array into 'm' subarrays to minimize the largest sum among them.
Use binary search to find the minimum largest sum possible.
Define a helper function to check if a target sum can be achieved with 'm' splits.
Example: For array [7, 2, 5, 10, 8] and m=2, the optimal split is [7, 2, 5] and [10, 8] with largest sum 15.
I applied via Approached by Company and was interviewed in Aug 2022. There were 2 interview rounds.
Edge score of nodes in a directed graph
Edge score is a measure of the importance of a node in a graph
It is calculated by counting the number of edges that point to or from a node
Nodes with higher edge scores are considered more important
Edge score can be calculated using algorithms like PageRank or HITS
Simulate rotting of oranges in a 2D matrix every second.
Create a queue to store the coordinates of fresh oranges
Iterate through the matrix and add the coordinates of fresh oranges to the queue
Simulate the rotting process by iterating through the queue and rotting adjacent fresh oranges
Keep track of the time taken for all oranges to rot
Return -1 if there are any fresh oranges left after the simulation
DB design for air ticket booking system
Create tables for flights, passengers, bookings, and payments
Use foreign keys to establish relationships between tables
Include fields for flight details, passenger information, and payment details
Consider implementing a caching mechanism for frequently accessed data
posted on 25 Jun 2024
I applied via Approached by Company
Implement rate limiting for a platform serving 100K requests per second.
Use a token bucket algorithm to limit the rate of incoming requests.
Set a maximum number of tokens in the bucket to control the rate.
Refill the bucket at a constant rate to allow bursts of requests.
Track the timestamp of the last request to enforce the rate limit.
Consider using a distributed rate limiting system for scalability.
Monitor and adjust t...
posted on 22 May 2025
I appeared for an interview in Nov 2024, where I was asked the following questions.
Design a scalable task scheduler to manage and execute tasks efficiently based on priority and timing.
Define task attributes: ID, priority, execution time, and status.
Use a priority queue to manage task scheduling based on priority.
Implement worker threads to execute tasks concurrently.
Consider persistent storage for tasks to survive system restarts.
Provide an API for adding, updating, and removing tasks.
I have extensive experience in software development, focusing on scalable applications and team collaboration.
Led a team of 5 developers in creating a microservices architecture for a healthcare application, improving scalability by 40%.
Implemented CI/CD pipelines using Jenkins and Docker, reducing deployment time from hours to minutes.
Collaborated with cross-functional teams to gather requirements and deliver features...
I applied via Naukri.com and was interviewed in Aug 2022. There were 2 interview rounds.
Use any sorting algorithm to sort the elements of an unsorted array.
Choose an appropriate sorting algorithm based on the size of the array and the type of elements.
Common sorting algorithms include bubble sort, insertion sort, selection sort, merge sort, quick sort, and heap sort.
Implement the chosen algorithm in the programming language of your choice.
Test the sorting function with various input arrays to ensure corre...
Find minimum energy required to cross all hurdles without losing life.
Calculate cumulative sum of energy required to cross each hurdle.
Find the minimum cumulative sum and add 1 to it.
If the minimum cumulative sum is negative, return its absolute value + 1.
This is the minimum energy required to cross all hurdles without losing life.
Easy Medium questions
Design a basic social networking platform similar to Facebook, focusing on user profiles, posts, and interactions.
User Registration: Users can create accounts with email and password.
User Profiles: Each user has a profile with a photo, bio, and friend list.
Posts: Users can create text, image, or video posts visible to friends.
News Feed: A central feed displays posts from friends and followed users.
Friend Requests: User...
I applied via Instahyre and was interviewed before Sep 2023. There were 3 interview rounds.
DP questions 1D DP and Array question
GCD of 2 strings is not a common concept in software engineering.
GCD of 2 strings is not a standard problem in software engineering.
It is more common to find GCD of integers or numbers.
If the strings represent numbers, you can convert them to integers and find the GCD.
based on 1 interview experience
Difficulty level
Duration
Assistant Manager
23
salaries
| ₹5.4 L/yr - ₹11.7 L/yr |
Product Manager
16
salaries
| ₹21.5 L/yr - ₹40 L/yr |
Software Developer
12
salaries
| ₹4.8 L/yr - ₹10 L/yr |
Senior Manager
12
salaries
| ₹26 L/yr - ₹49.9 L/yr |
Software Engineer
11
salaries
| ₹9.4 L/yr - ₹16 L/yr |
PhonePe
KFintech
Rupeek
Razorpay