Tutre

  Chess Knights Tour implementation in java. A knight’s tour is a sequence of moves of a knight on a chessboard such that the knight visits every square

Longest Common Subsequence implementation in java. Longest common subsequence (LCS) of 2 sequences is a subsequence, with maximal length, which is common to both the sequences. Given two

Tries Auto-complete using in java Auto complete implementation using tries data structure. Visit this page for Tries Abstract Data Type in Java

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