Mindsprint Snowflake Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

Q1. 
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...read more
Add your answer
Q2. 
Subtree Node Count Problem
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...read more
Ans. 
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
• Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.

• Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.

• The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

Q1. 
River Crossing: Help Ninja Cross Over
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...read more
Ans. 
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
• Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.

• Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.

• Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Q1. 
Left View of a Binary Tree Problem Statement
Given a binary tree, your task is to print the left view of the tree.
Example:
Input:
The input will be in level order form, with node values separated by a...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

It was a technical round held on skype.

Q1. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
Input:
The first line of input is an intege...read more
Add your answer
Q3. 
Merge K Sorted Arrays Problem Statement
You are provided with 'K' different arrays/lists, each sorted in ascending order. Your task is to merge all these arrays/lists into one sorted array/list in ascendi...read more
Ans. 
Merge K sorted arrays into one sorted array in ascending order.
• Iterate through all arrays/lists and merge them into one sorted array using a priority queue or merge sort algorithm.

• Ensure to handle edge cases like empty arrays/lists or arrays/lists with different sizes.

• Time complexity can be optimized by using a min-heap or priority queue to efficiently merge the arrays/lists.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was also a technical round held on Google meet.
 

Q1. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Add your answer

Q1. Interview was good but questions asked was very hard. You must have good technical knowledge.
Add your answer

Q1. Oops, java8, algorithm
Add your answer

Q1. How does consumer, producer work in kafka
Ans. 
Consumers read data from topics, while producers write data to topics in Kafka.
• Consumers subscribe to topics to read messages from them

• Producers publish messages to topics for consumers to read

• Consumers can be part of a consumer group to scale out consumption

• Producers can specify key for messages to control partitioning
Answered by AI
Add your answer

Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ

Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.

Q1. Technical Round 1 was 1hr long. Detailed Insights about my project and a few programming questions in DSA
Add your answer

Q1. This Technical Round 2 was 1hr long and was mainly focused on problem solving skills and a few basic programming concepts.
Add your answer

Q1. Three Situational questions were asked .
Add your answer