Skip to content

Tag Archives: Directi

Given a binary tree and 3 nodes a, b and c, the task is to find a node in the tree such that after removing… Read More
About the Company Recruitment Process Questions asked in Directi Interview Experiences Where To Apply About the Company: Directi comprises of a group of tech businesses… Read More
Method of applying : I applied to Directi via employee referral. Round 1: Online coding round (Codechef , 90 minutes) Problem 1 : Easy, Adhoc Statement… Read More
Given n, how many distinct Max Heap can be made from n distinct integers? Examples: Input : n = 3 Output : Assume the integers… Read More
Three questions were asked.  I remember 2 only. Write your Interview Experience or mail it to My Personal Notes arrow_drop_up Save
Given an positive integer n. Count the different numbers that can be generated using digits 1, 2, 3 and 4 such that digits sum is… Read More
Given a m x n matrix mat[][] containing positive integers. The problem is to reach to the cell (m-1, n-1) from the cell (0, 0)… Read More
Recently Directi visited our campus for full time hiring for the position of Platform Engineer. Online Round:(90 min) It was conducted on codechef. There were… Read More
Known to have one of the most rigorous interviews in the industry. The company offers two positions Directi Database/ Web developer Application Engineer 1st… Read More
The diameter of a tree is the number of nodes on the longest path between two leaves in the tree. The diagram below shows two… Read More
The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree. The… Read More
Directi came for the role of DevOps for the first time in our college. The selection process had Pen-Paper round followed by a Coding round… Read More
Directi came to our college to hire Software Developers. They came for 2 positions: Application Engineer and Platform Engineer. Coding Round This round was on… Read More
QUES 1) Problem Statement You are in a food logistics business. You have N jugs, each with unlimited capacity. Initially, each jug contains exactly 1… Read More