Sanchhaya Education Private Limited interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Sanchhaya Education Private Limited

3 rounds | 6 Coding problems

Anonymous

Fresher | Oct 2020

Selected

Interview preparation journey

Preparation

Duration: 2.5 months

Topics: Data Structures, Recursion, Dynamic Programming, OOPS, Pointers

Tip

Tip 1 : Be very clear with the basics of each topic.
Tip 2 : Be thorough with the projects mentioned in the resume.

Application process

Where: Campus

Eligibility: above 70%

Resume tip

Tip 1 : Don't lie on your resume.
Tip 2 : The number of projects on the resume does not matter, what matters is that you must be thorough with your projects.
Tip 3 : Do not write too much, it should be simple and decent

Interview rounds

Round

Easy

Online Coding Test

Duration160 minutes

Interview date6 Oct 2020

Coding problem2

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.

1. Two Sum

Easy

10m average time

90% success

0/40

Asked in companies

You are 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 Target.

Note:

Try solving now

2. Bridges In A Graph

Moderate

25m average time

65% success

0/80

Asked in companies

Given an undirected graph of V vertices and E edges. Your task is to find all the bridges in the given u...

Try solving now

Round

Easy

Video Call

Duration50 minutes

Interview date9 Oct 2020

Coding problem2

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.

1. Binary Tree Pruning

Moderate

20m average time

80% success

0/80

Asked in companies

You have been given a Binary Tree where the value of each node is either 0 or 1. Your task is to return the same Binary Tree but all of its subtrees that don't contain a 1 have been removed.

Try solving now

2. LRU Cache Implementation

Moderate

25m average time

65% success

0/80

Asked in companies

Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:

Try solving now

Round

Easy

Video Call

Duration30 minutes

Interview date2 Nov 2020

Coding problem2

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.