Sum of all nodes at a vertical level

Given a binary tree and a number n representing the vertical level. Write code to compute the sum of all nodes which are at vertical level n. For example, if the binary tree given is as below: and n=-1, then the output should be 12. Because Nodes at level =1 are 7 and 5 and […]

Posted in: Algorithms,
Vertical distance of a Node from root

Given a Binary Tree and a Node, Write a function that return the vertical distance of that node from root of the tree. The vertical distance of a node is computed as below: Then the vertical distance of root is 0. The vertical distance of right node is distance of root+1. The vertical distance of […]

Posted in: Algorithms,
Max value node between two elements of BST

Given an array of integers that represent values of nodes in a Binary Search Tree. For example, If the given array is {9, 4, 17, 6, 5, 3, 7, 22, 20} Then BST created from above array will be as below Two numbers are given (along with the array), find largest number in the path […]

Posted in: Algorithms,
Check if a subtree exist with a given sum

Given a binary tree and a Number N, write code to check if there exist a subtree of the Binary tree with sum of all the nodes = N. For example, if the Binary tree is as given on the right: And N = 12, then the output should be ‘true’ because there exist a […]

Posted in: Algorithms,
Reversing a linked list iteratively using only 2 pointers

Given a linked list, write the non-recursive function to reverse the list. If Input list is 1 -> 2 -> 3 -> 4 -> 5 Then output should be 5 -> 4 -> 3 -> 2 -> 1 We have seen the recursive and non-recursive functions to reverse the list. In the non-recursive version, we take three […]

Posted in: Algorithms,
How to prepare for Dynamic Programming Questions

The most difficult problems in Coding competitions and interviews of companies like Google, Microsoft etc. are from Dynamic Programming. DP as an approach to problem solving is discussed in almost all algorithm books. But, in most of the books, DP, as a concept is lost behind the difficult problems. For example, in one of the best […]

Posted in: Interview Tips,
Rotten Oranges Problem

Given a Matrix of order M*N, where each cell can have zero or one orange. The orange in the cell (if present) can be either fresh or rotten. A rotten orange will rot the fresh oranges in the nearby cell in unit time. If a rotten orange is in cell (i,j), then it will rot […]

Posted in: Algorithms,
Recursive function to add 5 to alternate nodes of the linked list

Write a recursive function that add 5 to the alternate nodes of the linked list. For example, if the list is 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10 then the function should change the list to the below one 1 -> 7 -> […]

Posted in: Algorithms,
Print a circular linked list

Write a function that prints all the elements of a circular linked list. (or traverse a circular linked list)

Posted in: Algorithms,
8 queens problem

This problem is to place 8 queens on the chess board so that they do not check each other. It can be asked in two ways: Find one of the possible solutions to place 8 -queens, so that no queen can attack any other. How many different ways are possible to place 8 queens such that […]

Posted in: Algorithms,




Comprehensive course covering everything needed to crack the interviews of companies like Google, Facebook, Microsoft, Amazon, etc.

  • Duration: 45 days
  • Mode: Online
  • Classes: Daily
  • Test: Daily

Campus Ladders

Prepare for best placements while in college. Three parallel tracks under mentorship of Industry Expert

  1. Core Computer Science Concepts
  2. Advance Technology
  3. Logic, Aptitude, Puzzle Solving
  • Duration: 3 Months

2-days Workshop

This workshop is a quick brush up and last minute revision of all the things that each must be prepared with, starting from how to improve your resume to the strategy used to prepare and scope of each topic for written test and interviews.

  • Duration: 15 hrs

2 hrs Free Seminar

Student will not just get all the questions answered about the scope and depth of topics to be covered for interviews of different companies, but will also have lot of stuff on how to improve resume and answer the HR questions.

  • Duration: 2hrs



We have best of trainers from across the world who are in decision making of top companies and passionate about technology.


Our content is created by subject experts from Industry.  They are ones who define the selection process of companies.


Approachable, empowering and genuine mentorship from top performers of industry to set your career on right track.