Skip to content

Tag Archives: Twitter

Phone screen – I  1. Fibonacci series without using an array – this is a typical favorite question w.r.t. Dynamic Programming where you will ask… Read More
Given a Binary Tree, the task is to print the left view of the Binary Tree. The left view of a Binary Tree is a… Read More
We have discussed Knight’s tour and Rat in a Maze problem in Set 1 and Set 2 respectively. Let us discuss N Queen as another… Read More
Total number of possible Binary Search Trees with n different keys (countBST(n)) = Catalan number Cn = (2n)! / ((n + 1)! * n!) For… Read More

Start Your Coding Journey Now!