All Medium Articles

This is one of the most used techniques in competitive programming. Let us first consider below simple question. What is the minimum time complexity to… Read More

Fibonacci

matrix-exponentiation

Modular Arithmetic

series

Algorithms

Competitive Programming

DSA

Dynamic Programming

Mathematical

Matrix

How to Create a Dynamic 2D Array Inside a Class in C++?

A dynamic array is an array that can grow, resize itself, contains a dynamic table, which is mutable in nature, or an array list is… Read More

cpp-array

cpp-class

cpp-pointer

C Language

C++

Aptitude | GATE IT 2006 | Question 8

Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width? (A) Transparent DMA and Polling interrupts (B)… Read More

Aptitude

Aptitude-GATE IT 2006

GATE IT 2006

GATE

Aptitude | GATE IT 2006 | Question 7

Given a boolean function f (x1, x2, …, xn), which of the following equations is NOT true (A) f (x1, x2, …, xn) =… Read More

GATE IT 2006

GATE-GATE IT 2006

GATE

Computer Organization and Architecture | Pipelining | Set 2 (Dependencies and Data Hazard)

Please see Set 1 for Execution, Stages and Performance (Throughput) and Set 3 for Types of Pipeline and Stalling. Dependencies in a pipelined processor There… Read More

Computer Organization & Architecture

Dyck path

Consider a n x n grid with indexes of top left corner as (0, 0). Dyck path is a staircase walk from bottom left, i.e.,… Read More

catalan

DSA

Mathematical

Gomory-Hu Tree | Set 1 (Introduction)

Background : In a flow network, an s-t cut is a cut that requires the source ‘s’ and the sink ‘t’ to be in different… Read More

Max-Flow

Advanced Data Structure

DSA

Find Recurring Sequence in a Fraction

Given a fraction, find a recurring sequence of digits if it exists, otherwise, print “No recurring sequence”. Examples: Input : Numerator = 8, Denominator =… Read More

Amazon

Fraction

Microsoft

DSA

Hash

Mathematical

Weighted Job Scheduling in O(n Log n) time

Given N jobs where every job is represented by following three elements of it. Start TimeFinish TimeProfit or Value Associated Find the maximum profit subset… Read More

DSA

Dynamic Programming

Construct a Binary Search Tree from given postorder

Given postorder traversal of a binary search tree, construct the BST. For example, if the given traversal is {1, 7, 5, 50, 40, 10}, then… Read More

SAP Labs

Binary Search Tree

DSA

Tree

Bin Packing Problem (Minimize number of used Bins)

Given n items of different weights and bins each of capacity c, assign each item to a bin such that number of total used bins… Read More

DSA

Greedy

Print all palindrome permutations of a string

Given a string, we need to print all possible palindromes that can be generated using letters of that string. Examples: Input: str = "aabcb" Output:… Read More

palindrome

permutation

DSA

Strings

Lexicographically Next Permutation of given String

All the permutations of a word when arranged in a dictionary, the order of words so obtained is called lexicographical order. in Simple words, it… Read More

CPP-Library

cpp-string

lexicographic-ordering

C Language

C++

Nearbuy(Groupon) Interview Experience | Set 3 (For Android Developer’)

Hacker Rank round 13 MCQ on java and android Find count of given words in the list of sentences Skype round (interview started late) 2… Read More

Groupon

nearbuy

Experiences

Interview Experiences

Applications of Catalan Numbers

Background : Catalan numbers are defined using below formula: Catalan numbers can also be defined using following recursive formula. The first few Catalan numbers for… Read More

catalan

DSA

Mathematical

Technical Scripter

D E Shaw Interview Experience | Set 16 (On-Campus for Internship)

First shortlisted based on CGPA >= 7.5 and ONLY CSE student allowed to sit in interview. They(D-E-Shaw) had 2 phases of selection procedure. FIRST PHASE… Read More

D-E-Shaw

Experiences

Internship

Interview Experiences

Frobenius coin problem

Given two coins of denominations “X” and “Y” respectively, find the largest amount that cannot be obtained using these two coins (assuming an infinite supply… Read More

DSA

Mathematical