Directi

74 posts

Last Updated: 23 July 2025

Here, you can find all the technical resources (articles, coding problems, subjective problems, video tutorials and interview experiences) that are helpful in preparing fo...read more

Interview Experiences

Directi

Directi Topics for Interview Preparation

Last Updated: 23 July 2025

Table of ContentEasy LevelMedium LevelHard LevelEasy LevelCount number of strings (made of R, G and B) using given combinationFind Maximum dot product of two arrays with i...read more

Interview Experiences

Directi

Lexicographically Smallest String by Swapping Indices

Last Updated: 28 July 2026

Given a string s and an array swaps[][], where each pair [u, v] denotes two indices (0-based), you may repeatedly swap the characters at any of the given pairs.Return the ...read more

Data Structures-Graph

strings

Distributing Blueberry Cheese Cake among Students

Last Updated: 23 July 2025

There is a school in a village. It has N classes. One fine day, someone donated B blueberry cheesecakes to schools. Now you need to divide these cakes such that:Each class...read more

Lexicographically smallest String with unique adjacent characters

Last Updated: 17 April 2024

Given a string consisting of 'a', 'b', 'c', or '?', you are required to replace the question marks '?' in the string. The goal is to find a replacement that adheres to the...read more

Compressed String decoding for Kth character

Last Updated: 23 July 2025

Given a compressed string composed of lowercase characters and numbers, the task is to decode the compressed string and to find out the character located at the Kth positi...read more

C Program For Stock Buy Sell To Maximize Profit

Last Updated: 23 July 2025

Efficient approach: If we are allowed to buy and sell only once, then we can use following algorithm. Maximum difference between two elements. Here we are allowed to buy a...read more

C++ Program For Stock Buy Sell To Maximize Profit

Last Updated: 23 July 2025

The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. For example, if the given array is {100, 1...read more

Java Program For Stock Buy Sell To Maximize Profit

Last Updated: 23 July 2025

The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. For example, if the given array is {100, 1...read more

Python Program For Stock Buy Sell To Maximize Profit

Last Updated: 23 July 2025

The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. For example, if the given array is {100, 1...read more

Javascript Program For Stock Buy Sell To Maximize Profit

Last Updated: 23 July 2025

The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling in those days. For example, if the given array is {100, 1...read more

MediaNet(DirectI) Interview Experience for SDE-2 (2-3 Years Experienced)

Last Updated: 22 October 2020

Arranged by a recruiter. They conduct a total of 3 rounds for SDE2Round 1: 3 questions on DS-Algo of Medium difficulty Given a binary tree, count the total number of un...read more

Interview Experiences

Sliding Window Maximum : Set 2

Last Updated: 12 July 2025

Set 1: Sliding Window Maximum (Maximum of all subarrays of size k).Given an array arr of size N and an integer K, the task is to find the maximum for each and every contig...read more

two-pointer-algorithm

Queries for Largest Square With Limited Ones in a Binary Matrix

Last Updated: 10 August 2026

Given a binary matrix mat[][] and an integer k, process a list of queries queries[][]. Each query contains coordinates [i, j] of the center of a square.For every query, fi...read more

On-Campus Interview Experience of companies like UBER, Directi, DE-Shaw, Microsoft.

Last Updated: 06 January 2020

I decided to write this article to help my fellow juniors with there interviews. I am not saying everything which I write in this article is necessarily true. This is just...read more

Interview Experiences

1 2 3 4 5