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,
Binary Heap

Binary heap is used to implement Priority queue. It is an array object, visualized as an almost complete binary tree. Binary heap comes in two flavours Max-Heap Min-Heap A max-heap is an almost complete binary tree, where, value at each node is greater than the value of its children. Similarly, a min-heap is an almost complete binary tree where […]

Posted in: Algorithms,
Almost complete Binary Tree

A complete Binary tree of height h has 2h-1 nodes. Out of these 2h-1 are leaf nodes and rest (2h-1-1 are non-leaf. Read more about complete binary trees here or watch video. Below are all complete binary trees:        

Posted in: Algorithms,
Coin heap puzzle

You are blindfolded and 10 coins are place in front of you on table. 5 are having their heads-side up and 5 are having their tails-side facing upward. You cannot tell which way they are by touching the coin. You are allowed to touch the coins and flip them as many times as you want. How […]

Posted in: Logic, Puzzles,
Minimum edit distance of two strings

Given two strings of size m and n respectively, find the minimum number of operations required to transform one string into another. The following thee operations are allowed Insert(pos, ch) – Insert a character at a position in the string. Delete(position) – Delete a character from a position in the string. Replace(position, character) – Replace […]

Posted in: Algorithms,
Check if array can be divided in two parts with equal sum

Given an array of integers, write a function that returns true if it can be divided in two parts having equal sum. For example: If Input array is {10, 20 , 30 , 5 , 40 , 50 , 40 , 15} Output: true Divide the array in two parts {0, 20, 30, 5, 40} […]

Posted in: Algorithms,
Print permutations of string replaced with digits

Given a string, print the variation of string as shown below Input String: ‘hat’ Replace one character with numeric one(‘1’): ‘1at‘, ‘h1t‘, ‘ha1‘ Replace two characters with ‘1’ each: ‘11t‘, ‘h11‘, ‘1a1‘ Replace three characters with ‘1’ each: ‘111‘ In all the strings above, wherever the numeric characters are consecutive, add them. So ’11t’ will become ‘2t’, Similarly ‘111’ […]

Posted in: Algorithms,




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

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