# Tag Archives: Directi

A number is called as a Jumping Number if all adjacent digits in it differ by 1. The difference between ‘9’ and ‘0’ is not… Read More
An article containing recent Directi programming round questions in my campus placements and also those in my friends’ colleges.  1) You are given a string… Read More
Given a matrix with 0 and 1’s, find the largest rectangle of all 1’s in the matrix. The rectangle can be formed by swapping any… Read More
Consider a big party where a log register for guest’s entry and exit times is maintained. Find the time at which there are maximum guests… Read More
Recently Directi visited our campus for intern selections. There was 1 Online coding round hosted on codechef, 2 Algo Interview round and 1 Technical round.>… Read More
There was 1 online coding round, followed by interviews. Online coding round was on Codechef. Online round: There were 2 questions. Question 1: A string… Read More
I took Coding Round 1 of Direct I campus recruitment today. Sharing the 2 questions which have been asked. Question 1 (Optimal substring reversal): You… Read More
MS Excel columns have a pattern like A, B, C, …, Z, AA, AB, AC, …., AZ, BA, BB, … ZZ, AAA, AAB ….. etc.… Read More
Given a binary tree in which each node element contains a number. Find the maximum possible sum from one leaf node to another.  The maximum… Read More
Online round: 1. There exist a binary tree with each node containing a character (lower case letters for leaf nodes and upper case letters for… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and… Read More
There was 1 online coding round, followed by interviews. Online coding round was on Codechef. 1st question Sandeep and Pali want to go on holiday.… Read More
Written Round: 1) Given a binary tree, such that each node contains a number. Find the maximum possible sum in going from one leaf node… Read More
Given a partially filled 9×9 2D array ‘grid[9][9]’, the goal is to assign digits (from 1 to 9) to the empty cells so that every… Read More
Given an array and an integer K, find the maximum for each and every contiguous subarray of size k. Examples :  Input: arr[] = {1,… Read More