Sanchhaya Education Software Developer Intern Interview Questions and Answers

Round duration - 160 minutes
Round difficulty - Easy

The online assessment consisted of four components, a code debugging section (20 minutes), a coding test (70 minutes), a workstyles assessment (20 minutes) and a reasoning ability section (35 minutes). Code debugging questions were pretty simple and straightforward. The coding test consisted of 2 questions, first was similar to two Sum problem. Second question was similar to find the critical edges in a graph. The workstyles assessment section contained certain behavioural questions.
Reasoning ability section consisted of aptitude questions. This round was basically to check the problem solving skills of the candidate.

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Add your answer
Q2. 
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...read more
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

I was asked two coding questions. First question was related to binary tree and second question was to implement LRU cache.
I had to code both questions. The interviewer asked me the time and space complexity for both the questions.

Q1. 
Binary Tree Pruning Problem Statement
You are provided with a binary tree where each node's value is either 0 or 1. Your goal is to prune the binary tree by removing all subtrees that do not contain at le...read more
Ans. 
Prune a binary tree by removing subtrees without any '1' nodes.
• Traverse the tree using BFS and remove subtrees without any '1' nodes

• Update the tree in level order after pruning

• Return the pruned binary tree
Answered by AI
Add your answer
Q2. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraints.
• Implement a doubly linked list to keep track of the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access and updates.

• When the cache reaches its capacity, evict the least recently used item before inserting a new item.

• Update the order of keys in the linked li...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

I was asked two coding questions and some conceptual questions about priority heap data structure. I was able to code the optimized approach for the first question. But second question was a little tricky for me as I had never heard it before.

Q1. 
Langford Pairing Problem Statement
Given a positive integer N, you are required to generate a list of integers of size 2N such that it contains all the integers from 1 to N, both included, twice. These in...read more
Ans. 
Generate Langford pairing for given N, return 'Valid' if correct, 'Invalid' if not.
• Generate a list of integers of size 2N with Langford pairing rules

• Return 'Valid' if pairing is correct, 'Invalid' if incorrect

• If no valid pairing possible, return list with only -1 element
Answered by AI
Add your answer
Q2. 
Ninja Theater Seating Arrangement Problem
As the technical lead of the renowned ninja theater, your task is to implement a system that ensures social distancing by maximizing the distance between seated i...read more
Ans. 
Implement a system to maximize social distancing in a theater seating arrangement by determining the best seating arrangement for incoming theater-goers.
• Create a function that takes the number of seats 'N' and a list of queries 'M' as input.

• For each query of type 1, find the seat with the maximum distance from the nearest seated person.

• Return the seat numbers a person should choose to maintain maximum distance from oth...read more
Answered by AI
Add your answer