You are given a directed graph. You need to find the arrival and departure time of all the vertices in the graph. Arrival time is

# Category: Practice Problems

Practice Problems related to technical Interviews

## Print all paths from Root to leaf.

You are given a binary tree, you need to print all the paths from root to leaf nodes. In the above figure, the paths from

## Right View of a Binary Tree

You are given a Binary Tree, you need to print the right view of the tree. Consider the tree in the below figure. The right

## Majority Element

Given an array, you need to find the majority element if it exists, else return “NO”. A majority element of an array of size N,

## Sort an array of 0’s, 1’s and 2’s

You are given an array whose elements are only 0’s, 1’s and 2’s. You need to sort the array in increasing order in linear time

## Top 20 Dynamic Programming Interview Questions

Here is a curated list of top 20 Dynamic Programming questions that are mostly asked in online coding rounds, face to face technical interviews and