Graph and its representations – Graph Algorithms – Graph is data structure that consists of finite set of vertices whether there is edge from vertex u to v.
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
PYTHON Programming for Write a program to print all permutations – Mathematical Algorithms – A permutation, also called an “arrangement number” or “order”
C 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.
Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Searching and sorting – We have already discussed Naïve [O(n3)] and quadratic [O(n2)]
C++ Programming for Write a program to print all permutations of a given string – Mathematical Algorithms -A permutation also called an “arrangement number”
C Programming for Write a program to print all permutations of a given string – Mathematical Algorithms – A permutation, also called an “arrangement number”
Closest Pair of Points | O(nlogn) Implementation – Geometric Algorithms – We are given an array of n points in the plane, and the solution for problem
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].
C++ 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].
C 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.