Given a string, write a function to check if it is a permutation of palindrome.
Algorithm to find middle node in LinkedList, To find middle node we will use two pointers P1 and P2, We will increment P2 after every two steps of P1.
LinkedList is most popular subject in interview room. This post is about creating your own LinkedList. It will be helpful for solving LinkedList related algorithms.
Right circular rotation on an array of integers [1,2,…,n-1,n]. After performing one right circular rotation operation, the array is transformed from [1,2,…,n-1,n] to [n,1,2,…,n-1]. Perform rotation k number of times and find out element in particular position. Inputs : Line One : Size of array, Number of rotation, Number of positions going to print. Line… Read more
Fibonacci sequence : It is the sum of the two preceding ones
Here we are going to start with basics of machine learning, Here we are going to write program to tech our machine to identify Apple or Orange.
Given a string s, form a shortest palindrome by appending characters at the start of the string abab = babab
This is small algorithm to generate binary search tree using given Root Value and Values to insert in root.
Given a sorted array keys[0.. n-1] of search keys and an array freq[0.. n-1] of frequency counts, where freq[i] is the number of searches to keys[i]. Construct a binary search tree of all keys such that the total cost of all the searches is as small as possible.
Generate topologically sorted order for directed acyclic graph, Here we are going to consider graph as a “Directed Graph”, Please visit my below article for more details about Directed and Undirected Graph Directed and Undirected Graph Input : Output : B > P > A > C > D > H > G > I… Read more