## Minimum number of given operations required to make two strings equal

Given two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… Read More »

- Number of ways to partition a string into two balanced subsequences
- Minimum number of given operations required to make two strings equal
- Minimum time to return array to its original state after given modifications
- Count Unary Numbers in a Range
- Count number of integers less than or equal to N which has exactly 9 divisors
- Check if a number is a Trojan Number
- Determining the inconsistently weighted object

Given two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… Read More »

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 »

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 »