Radix Sort

Consider an array that stores account numbers of all employees. One unique thing about account numbers is that they have equal number of digits. Let us take example where, account numbers are three digits long, and array has 6 account numbers are shown below int arr[ ] = {582, 675, 591, 189, 900, 770} Range […]

Posted in: Algorithms,
Sum of all the nodes in a tree

Given a binary tree, where each node is having an integer value. Write a function that accept the root of this tree and returns the sum of all the nodes in the tree. The sum of all the nodes in the

Posted in: Algorithms,
Count number of zeros in a Row-wise Col-wise sorted binary matrix

Given a binary matrix with all rows and col sorted. Write code to count the number of zeros in that matrix. For example, if the matrix is [0, 0, 0, 0, 1] [0, 0, 0, 1, 1] [0, 1, 1, 1, 1] [0, 1, 1, 1, 1] [1, 1, 1, 1, 1] Then output should […]

Posted in: Algorithms,
Iterative pre-order traversal using stack

We have seen the in-order traversal of a binary tree. It is a recursive code. Recursion stack can be simulated using an explicit Stack data structure and keeping the function non-recursive. Let us see how:

Posted in: Algorithms,
Right view of a binary tree

Write code to print the right-view of a binary tree. Right-view of the tree is the nodes visible when the tree is seen from the right side. If there are two nodes at the same level, then only the right-most node will be visible in the right-view as shown below:

Posted in: Algorithms,
Left view of a binary tree

Write code to print the left-view of a binary tree. Left-view of the tree is the nodes visible when the tree is seen from the left side. If there are two nodes at the same level, then only the left-most node will be visible in the left-view as shown below:

Posted in: Algorithms,
Sort in C++ standard template library

Two elements of complex data types are not directly comparable. Consider the student structure defined as below struct Student { int rollNo; char name[25]; char grade; }; Student arr[MAX_NUM_STUDENTS]; Objects of Student type are not directly comparable. To sort array arr, we need to specify how one student compares with another student. If there are […]

Posted in: Algorithms, C++,
Feedback for Engineering colleges

I visit many colleges and universities (mostly technical). Following is my feedback:

Posted in: Articles,
Check if a Tree is Almost Complete Binary Tree

Given a pointer to the root node of the tree, write code to find if it is an Almost Complete Binary Tree or not? A Binary Tree of depth d is Almost Complete iff: The tree is Complete Binary Tree (All nodes) till level (d-1). At level d, (i.e the last level), if a Node […]

Posted in: Algorithms,
HashMap performance improvement in Java 8

What improvement has java-8 made that performance of HashMap.get() function call is fast by 20% in Java-8.

Posted in: Java, Language,



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

  • Duration: 30 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.