MindTickle interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

MindTickle

3 rounds | 4 Coding problems

Dev Garg

Fresher | Oct 2021

Rejected

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures, Algorithms, System Design, Operating Systems, Oops, DBMS

Tip

Tip 1 : Prepare system design
Tip 2 : Practice as many DSA questions.

Application process

Where: Referral

Eligibility: NA

Resume tip

Tip 1 : Add Internship and project details clearly
Tip 2 : Add Github links to your projects

Interview rounds

Round

Medium

Face to Face

Duration60 minutes

Interview date7 Oct 2021

Coding problem2

This round was conducted by the Interview Vector, Usually first two rounds are conducted by Interview vector on behalf of mindtickle, Interviewer joined the call on time. He gave his introduction and asked to introduce me. He asked about some of my projects and internships than directly jumped to DSA questions. He shared me the Leetcode question link and I have to write the code there and have to submit it. After that I have to paste my solution on a Google doc shared by him and have to write my approach, Time complexity and space complexity of the solution. So he asked two questions in this round and I solved first one completely and second one partially, questions were of medium and hard difficulty level respectively.

1. Is Bipartite

Moderate

0/80

Asked in companies

You are given an undirected graph consisting of ‘N’ nodes from 0 to ‘N’ - 1. You are given a list ‘EDGES’ of size ‘M’, consisting of all the edges of this undirected graph. Determine whether the given graph is Bipartite or not.

Note:

The graph has no self-edges, no parallel edges.

The graph may not be connected.

A graph is bipartite if the nodes of the graph can be partitioned into two independent sets A and B such that every edge in the graph connects a node in set A and a node in set B.

For Example,

If ‘N’ = 4, ‘M’ = 5, edgeList = [ [0, 1],[0, 3],[1, 2] ].

Here, you can see that the graph is bipartite as we can divide the nodes in two sets as follows:
setA = [0, 2].
setB = [1, 3].

In the graph, you can see that every edge in the graph connects a node in set A and a node in set B.
Hence, the output is “Yes”.

Problem approach

I solved this question by using BFS.

Try solving now

2. Topological Sort

Easy

0/40

Asked in companies

You are given a directed acyclic graph. Your task is to find any topological sorting of the graph.

A directed acyclic graph is a directed graph with no directed cycles.

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge from u to v, vertex u comes before v in the ordering.

For example-

For the given DAG-

One of the possible topological sort will be-
1  2  3

Problem approach

I tried to solved this question by depth first search approach.

Try solving now

Round

Medium

Face to Face

Duration60 minutes

Interview date14 Oct 2021

Coding problem1

This round was also conducted by the Interview Vector, we started with the Introduction that she told me that their will be no correct or wrong answer for this round they will check by thinking ability and how vast I can think in designing a system. Than she gave me the problem statement in which I have to design an online Transport renter service. she also shared some requirements with me and shared a google doc where I have to write all the things that will come in my mind. So we discussed about the DB and tables that we will be requiring in this service, we also discussed for different enitities that we'll be requiring than our time gets over and we winded up and Thanked each other and dropped the call.

1. System Design Question

Design an online Transport Renter service.

Round

Medium

Face to Face

Duration60 minutes

Interview date28 Oct 2021

Coding problem1

This round was taken by the SDE-2 of the MindTickle and it was also a system design round. We both started with the introduction then he gave me the problem statement to design a chess board game. We both started discussing on it, I started writing down the entities and services that we'll be requring. Than he told me to write the methods in each service and implement them, I got confused in them and started messing up the things. we discussed various things related to methods and services implementation and our time got over than he winded up and asked for any questions and we dropped the call.