Java Programming Edit Distance – Dynamic Programming – Idea is process all characters one by one staring from either from left or right sides of both string
JAVA
113 Articles
113
Java Algorithm – Depth First Traversal or DFS for a Graph -Graph Algorithms -Depth First Traversal for a graph is similar to Depth First Traversal of a tree
Java programming – Sieve of Eratosthenes – Mathematical Algorithms – Given a number n, print all primes smaller than or equal to n.For example, if n is 10.
JAVA Programming-Backtracking Set 3 (N Queen Problem) – JAVA – discuss N Queen as another example problem that can be solved using Backtracking.
Java programming for Searching for Patterns Set 2 KMP Algorithm – Searching and sorting – Given a text txt[0..n-1] and a pattern pat[0..m-1].
JAVA Programming for Write a program to print all permutations of a given string – Mathematical Algorithms – A permutation also called “arrangement number”
JAVA Programming-Backtracking Set 2 (Rat in a Maze) – Backtracking – A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1].
JAVA Programming-Backtracking Set 1 (The Knight’s tour problem) – Backtracking – Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that “works”. Problems which are typically solved using backtracking technique have following property in common.
JAVA Programming-Write a program to print all permutations of a given string – Searching and Sorting – A permutation, also called an “arrangement number” or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself.
JAVA Programming-Print all possible strings that can be made by placing spaces – Searching and Sorting – The idea is to use recursion and create a buffer.