interviews?

Learn from the best

instructors in the field.

Try Academy for FREE

**1 Telephonic interview**1st round is a telephonic interview with an experienced developer and focuses exclusively on problem-solving, data-structures, and algorithms.**Onsite Interview:**focused on problem-solving and coding.**Technical Interviews**spans for 90 minutes. It features questions about everything (technical) that is mentioned in the applicant’s resume. The questions also focus on any self-run projects and internships done by the candidate.**HR Interview**spans for 30-40 minutes. It features items about the candidate’s competencies according to their resume. Sometimes, candidates are handed over a case study about the company and asked questions based on that.

**Coding rounds:**Material in the programming section of InterviewBit is pretty comprehensive. For your reference, the section below has some of the questions which are frequently asked in Directi's Interview. Make sure to try and solve most of them.**Design rounds:**InterviewBit System Design prep has you covered here. Make sure to go through some frequently asked interview problems listed on the page.**Cultural fit rounds:**In most cases, this should not be an issue. However, go through Cultural Fit Interview Guidelines to make sure you don't make common mistakes.

Max Sum Path in Binary Tree

Given a binary tree T, find the maximum path sum.
The path may start and end at any node in the tree.
Input Format:
The first and the only argument ...

Window String

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in linear time complexity.
Note that when the ...

Min Steps in Infinite Grid

Problem DescriptionYou are in an infinite 2D grid where you can move in any of the 8 directions
(x,y) to
(x+1, y),
(x - 1, y),
(x, y+1)...

Design URL Shortener

Shortening: Take a url and return a much shorter url. Ex: http://www.interviewbit.com/courses/programming/topics/time-complexity/ => http://goo.gl/...

Ways to form Max Heap

Problem DescriptionMax Heap is a special kind of complete binary tree in which for every node the value present in that node is greater than the value ...

Valid Path

There is a rectangle with left bottom as (0, 0) and right up as (x, y). There are N circles such that their centers are inside the rectangle.
Radius o...

Largest area of rectangle with permutations

Problem DescriptionGiven a binary grid A of size N x M consisting of 0's and 1's, find the area of the largest rectangle inside the grid such that all ...

Sheldon and Pair of Cities

Sheldon lives in a country with N cities (numbered from 1 to N) and M bidirectional roads. Each road has a distance associated to it Wi.
Now he has m...

Weight collection

Given a tree T containing N nodes numbered [1,2, …, N] rooted at node 1. Each node has a value associated with it. You are also given a number K. You n...

Chain of Pairs

Problem DescriptionGiven a N * 2 array A where (A[i][0], A[i][1]) represents the ith pair.
In every pair, the first number is always smaller than the s...