## Number of ways to partition a string into two balanced subsequences

Given a string ‘S’ consisting of open and closed brackets, the task is find the number of ways in which each character of ‘S’ can… Read More »

- Stock Buy Sell to Maximize Profit
- Sliding Window Maximum (Maximum of all subarrays of size k)
- Diameter of a Binary Tree
- Sudoku | Backtracking-7
- Find the maximum path sum between two leaves of a binary tree
- Maximum size rectangle binary sub-matrix with all 1s
- Diameter of a Binary Tree in O(n) [A new method]
- Boggle | Set 2 (Using Trie)
- Find Excel column name from a given column number
- Find the point where maximum intervals overlap
- Print all Jumping Numbers smaller than or equal to a given value
- Diameter of a tree using DFS
- Check if an array can be divided into pairs whose sum is divisible by k
- Find the largest rectangle of 1's with swapping of columns allowed
- Path in a Rectangle with Circles
- Probability of Knight to remain in the chessboard
- Constant time range add operation on an array
- N-th root of a number
- K-Nearest Neighbours
- Number of ways to form a heap with n distinct integers
- Directi Interview | Set 7 (Programming Questions)
- Find Maximum dot product of two arrays with insertion of 0's
- Largest sum Zigzag sequence in a matrix
- Count number of strings (made of R, G and B) using given combination
- Directi Interview | Set 6 (On-Campus for Internship)
- Find number of subarrays with even sum
- Finding the maximum square sub-matrix with all equal elements
- Directi Recruitment Process
- Directi Interview Experience | Set 23 (On-Campus for Platform Engineer)
- Count different numbers that can be generated such that there digits sum is equal to 'n'

Given a string ‘S’ consisting of open and closed brackets, the task is find the number of ways in which each character of ‘S’ can… Read More »

Given two arrays of integers arr and P such that after a cycle an element arr[i] will be at location arr[P[i]]. The task is to… Read More »

Given two numbers A and B, A<=B, the task is to find the number of unary numbers between A and B, both inclusive. Unary Number:… Read More »

Given a Number . The task is to check if N is a Trojan Number or not. Trojan Number is a number that is a… Read More »

Given a number N(1<=N<=109), the task is to find the total number of integers less than equal to n which have exactly 9 divisors. Examples:… Read More »

Given N objects numbered from 1 to N out of which all are of the same weights except only one object which is not known… Read More »

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 »

There is a m*n rectangular matrix whose top-left(start) location is (1, 1) and bottom-right(end) location is (m*n). There are k circles each with radius r.… 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. https://www.codechef.com/DI17R043/problems/MATPATH https://www.codechef.com/DI17R107/problems/CHEFSOCD Write your Interview Experience or mail it to contribute@geeksforgeeks.org 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 »

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 Media.net Database/ Web developer Application Engineer 1st… Read More »