Branched and Detailed Structure of DS and Algorithms with implementation
C++
Data Structure and Algorithm (C++)
Maths
Counting No of Digit
Checking weather the no is Palindrome (reverse == original) or not
Calculating Factorial
Counting no of zeros in factorial
GCD of two number
LCM of two number
Prime Or Not
printing all the Prime Factors of a number
Diviors of Number
Sieve of Erastothenes
Bits
Bitwise Operator (And, Or, Xor)
Bitwise Operator (Left shift, Right Shift, Not)
Check Kth bit is set or not
Count set bits
Power of two
One odd Occurance
Two odd Occurance
Power set
Recursion
Introduction & Application
Printing 1 to N
Printing N to 1
Tail recursion
writting Base cases
Sum of Natural number
Checking Palindrome
Sum of Digit
Rope Cutting Problem
Generate Subsets
Tower of Hanoi
Josephus Problem
Arrays
Introduction
Array Types
Largest element
Second Largest element
Check if an array is sorted or not
Reverse an array
Remove dublicates from array
Moving zeros to end
Rotating array left by one
Rotating array left by N
Leaders in an array
Maximum difference in order
Frequency in sorted array
Max consecutive one
STL (Standard Template Library)
Overview
pairs
vectors
Iterators
Map, Unordered Map & MultiMap
Set, Unordered Set & MultiSet
Stack & Queues
Search
Linear Search
Binary Search (Iterative)
Binary Search (Recursive)
First occurance
Last occurance
Count occurance
count 1's in sorted array
Square root
Search in Infinte array
String
Introduction
Frequency of character in string
Check Palindrome
Check String is subsequence of other or not
Check for Anagram
Left Most Repeat
Right Most Repeat
Reverse Word in a string
Linked List
Single Linked List
1. Implementation + Traversing(Iterative && Recursive)
2. Insert at beginning
3. Insert at end
4. Delete First Node
5. Delete Last Node
6. Insert at random postion(N)
7. Search in List
Doubly Linked List
1. Implementation + Traversing
2. Insert at beginning
3. Insert at end
4. Reversing Doubly Linked List
5. Delete First Node
6. Delete Last Node
Circular Linked List
1. Implementation + Traversing
2. Insert at beginning
3. Insert at end
4. Delete First Node
5. Delete Kth Node
Stack
Implementation :
a. Array Implementation
b. Vector Implementation
c. STL Implementation
d. Linked List Implementation