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,
Separate Chaining: Hashing collision handling technique

It is almost impossible to design a generic hash system without collision. In case of collision, it need to be handled. There are multiple ways of handling collision. Separate chaining is one of such techniques.

Posted in: Algorithms,
Birthday Paradox (Birthday Problem)

You may solve the simple probability, “Given a set of n randomly chosen people, what is the probability of two people having same birthday?” You may also solve,  “At least how many people need to be picked to make the probability 100% that at least two of them have same birthday?” Answer to the second question is […]

Posted in: Logic, Quantitative Aptitude,
Hashing introduction

Let us design a data structure in which we want to store numbers (taking it for simplicity, else it can be anything). We want to minimise the time taken by the following three operations: Insertion, time taken to insert a new value. Deletion, time taken to remove an existing value. Searching, time taken to search […]

Posted in: Uncategorized,
Medicine tablet (Pill) taking puzzle

Doctor gave you two types of medicine tablets (pils) A and B, and asked you to take one from each daily. The two tablets are in different bottles and look exactly same One day, while taking the pills, you open Bottle-A and tap one pill out in your hand. Then you open the second bottle to […]

Posted in: Logic, Puzzles,
Check if two node are siblings in a binary tree

Given a binary tree and two values. Find if these values appear in sibling nodes in the tree. For example, if tree is Then 2 and 6 are siblings but 6 and 9 are not siblings (they are cousin nodes).

Posted in: Algorithms,
Check duplicate parenthesis in an expression

A valid mathematical expression can also have duplicate parenthesis as shown below: ((a+b)) (((a+(b)))+(c+d)) Write code to find if an expression has duplicate parenthesis. You may assume that expression does not have any white spaces.

Posted in: Algorithms,
Next greater element

Print Next Greater Element for every element in the array. The Next greater Element of element x is first greater element on its right side. Elements for which no greater element exist, next greater element is -1. Example: – For any array, rightmost element always has next greater element as -1. – All elements of […]

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.