Month: August 2015

Oyo Rooms will be the next game changer in Indian start up history. It has the potential to grow and cover international cities. It can be India's Airbnb

Given a Linked List and a number n, write a program that finds the node at the nth node from end of the Linked List. Solution : Take

Breadth first search : Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary

Depth First Search : Depth-first search (DFS) is an algorithm for traversing graph data structures. One starts at the root and explores as far as possible along each

We have a list of N nodes with each node pointing to one of the N nodes. It could even be pointing to itself. We call a node

There are ‘n’ ticket windows in the railway station, ith window has a[i] tickets available. Price of a ticket is equal to the number of tickets remaining in

1. Reverse List in place, Time : O(n) and Space : O(1). 2. Reverse List in Pairs in place, Time : O(n) and Space : O(1). 3. Reverse

Detect and Remove Loop in a Linked List. Solution : 1 : Using map maintain key value pair of node and its next pointer , while traversing before

Clone a linked list with next and random pointer. Solution 1 : By using Map, In first traversing of list clone the entire list into map. And now

John Conway’s Game of Life : Implementation in Java Game Rules : 1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.