The dharmendrarathor.github.io from dharmendrarathor

Fibonacci Series - 1. Using loop. 2. Using recursion. 3. Using memoization.(Technique to improve speed of computation by storing complex calculation results)
PrimeNumber- Prime number is number which is only divisible by 1 and itself. eg : 2,3, 5, 7 , 11..
Palindrome - Palindrome is word, number which is same forward and backword. eg 45654,abcba is palindrome eg 45655,abcbb is not palindorme.
Duplicate element in Array - Program to find duplicate element in array in O(n) time and fixed space complexity.
Highest frequency element in array - Program to find highest frequency element in array using two approach with complexity O nlogn and O n .
Unique character in String - Program to find String has unique char or not.
SetBitCount - Program to find count of set bit in positive integer.

Binary search Tree and Traversal - Creation of binary search tree and InOrder, PreOrder and PostOrder traversal.
Mirror of Binary Tree - Code to create mirror of binary tree.
RightView Binary tree - Using Queues and Level order traversal (BFT).
ReverseLevelOrderTreeTraversal - Program to traverse level vise binary tree nodes in reverse order , starting from botton first .
Height of Binary tree - Program to find height of binary tree .
Sub Tree check - Program to check if tree is subtree of another tree.
Binary tree to binary search tree - Program to convert binary tree to binary search tree.
Bottom view of binary tree - Program to display bottom view of binary tree.
Connect node at same level - Program to connect node at same level.
Serialize and Deserialize binary tree - Program to serialize and deserialize binary tree.
Spiral level oder tree traversal - Program to travel tree in spiral level order.

Middle element in Link List -Finding middle element in a linked list using two pointer approach.
Remove Duplicate in List -Remove duplicate element from Linked List Given a singly linked list consisting of N nodes. The task is to remove duplicates (nodes with duplicate values) from the given list (if exists)..
Find Nth Element from End -Nth node from end of linked list. Given a linked list consisting of L nodes and given a number N. The task is to find the Nth node from the end of the linked list.
Reverse list in group of given size -Given a linked list of size N. The task is to reverse every k nodes (where k is an input to the function) in the linked list.
Length of loop in link list - Program to find length of loop in link list.

Highest frequence In Array -Program to find element in array having highest frequency. Two approaches One * with time complexity O(n log n) and other o(n).
Peek element in Array -Given an array A of integers. The task is to find a peak element in it. An array element is peak if it is not smaller than its neighbors. For corner elements, we need to consider only one neighbor.
ReverseWordInString -Given a String of length N reverse each word in it. Words are separated by dots. " Input : i.like.this.program.very.much Output : i.ekil.siht.margorp.yrev.hcum " .

Queue Using Two Stacks -Implement a Queue using 2 stacks s1 and s2 .
Special Stack - Design a data-structure SpecialStack (using the STL of stack) that supports all the stack operations like push(), pop(), isEmpty(), isFull() and anadditional operation getMin() which should return minimum element from the SpecialStack. Your task is to complete all the functions, using stack.

Longest Palindromic subSequence -Find length of longest palindromic sub sequence for given string.
Longest Palindromic subString -Find length of longest palindromic sub strong for given string .

dharmendrarathor / dharmendrarathor.github.io Goto Github PK