Difference between nodes of alternate vertical levels in a tree

The question below is given in the format in which questions are asked on coding interview Platforms like HackerRank, CodeChef, CodeJam, etc. PROBLEM STATEMENT Vertical level of a node is the vertical distance of that node from the root. Vertical level of the root node is 0. If a node is at vertical level k, […]

Posted in: Algorithms,
Rearrange the nodes of a linked list

Given a linked list, rearrange the node of the list as shown below: INPUT LIST: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 OUTPUT: 1 -> 8 -> 2 -> 7 -> 3 -> 6 -> 4 -> 5 INPUT LIST: 1 -> 2 -> 3 -> 4 […]

Posted in: Algorithms,
Merge alternate nodes of the two lists

We have already seen the code to merge two sorted linked list, such that the final list is also sorted. The logic and code can be found in this post. In this post, we want to merge the two lists in a way that in the final list, element comes from the two lists alternately […]

Posted in: Algorithms,
Water overflowing from glass arranged in form of triangle

Glasses are arranged in the form of triangle (on top of each other) as shown below: 1 2 3 4 5 6 7 8 9 10 ……………….. …………………. Liquid is poured into 1st glass (Glass no. 1). When it is full, then extra liquid will flow into the glasses 2 and 3 in equal quantities. […]

Posted in: Algorithms,
Protected: live classes

There is no excerpt because this is a protected post.

Posted in: Uncategorized,
Maximum (or minimum) sum of subarray of size k

Given an array of n integers, find the sub-array of length k with maximum sum. For example, Input Array: {6, 4, 3, 5, 1, 9, 2} k:3 Output: 15 (sum of sub-array 5, 1, 9)

Posted in: Algorithms,
Consecutive numbers with sum equal to n

Given a positive integer n, print the consecutive numbers whose sum is equal to n. For example, n = 20 Output: 2, 3, 4, 5, 6 (because 2+3+4+5+6+7 = 20) n = 29 Output: 14, 15

Posted in: Algorithms,
Number of ways to arrange tiles on a board

Given a board of size 2*n and tiles of dimension 1*2 each. In how many ways can we arrange the tiles so that entire board is covered. We can only place the tiles either horizontally or vertically without breaking them. For example, if the board is of length 3 (n=3), then tiles can be placed […]

Posted in: Algorithms,
Dynamic Programming concept

The basic idea of DP is applicable to problems that can be thought in terms of recursion. For example, consider problem of computing n’th fibonacci term:

Posted in: Algorithms,
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,



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 within the college. This works in partnership with the college, inside the campus

  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

3 Months Class-room Coaching

This unique course help students ace in programming interviews of top tech companies by honing their problem-solving abilities.

We do not work just toward getting them placed. Our vision is to transform students into confident, informed and skilled professionals.

  • Duration: 3 Months



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.