rohan-singh987 / Data-Structure-and-Algorithm

Branched and Detailed Structure of DS and Algorithms with implementation

Data Structure and Algorithm (C++)

Maths

1. Counting No of Digit
2. Checking weather the no is Palindrome (reverse == original) or not
3. Calculating Factorial
4. Counting no of zeros in factorial
5. GCD of two number
6. LCM of two number
7. Prime Or Not
8. printing all the Prime Factors of a number
9. Diviors of Number
10. Sieve of Erastothenes

Bits

1. Bitwise Operator (And, Or, Xor)
2. Bitwise Operator (Left shift, Right Shift, Not)
3. Check Kth bit is set or not
4. Count set bits
5. Power of two
6. One odd Occurance
7. Two odd Occurance
8. Power set

Recursion

1. Introduction & Application
2. Printing 1 to N
3. Printing N to 1
4. Tail recursion
5. writting Base cases
6. Sum of Natural number
7. Checking Palindrome
8. Sum of Digit
9. Rope Cutting Problem
10. Generate Subsets
11. Tower of Hanoi
12. Josephus Problem

Arrays

1. Introduction
2. Array Types
3. Largest element
4. Second Largest element
5. Check if an array is sorted or not
6. Reverse an array
7. Remove dublicates from array
8. Moving zeros to end
9. Rotating array left by one
10. Rotating array left by N
11. Leaders in an array
12. Maximum difference in order
13. Frequency in sorted array
14. Max consecutive one

STL (Standard Template Library)

1. Overview
2. pairs
3. vectors
4. Iterators
5. Map, Unordered Map & MultiMap
6. Set, Unordered Set & MultiSet
7. Stack & Queues

Search

1. Linear Search
2. Binary Search (Iterative)
3. Binary Search (Recursive)
4. First occurance
5. Last occurance
6. Count occurance
7. count 1's in sorted array
8. Square root
9. Search in Infinte array

String

1. Introduction
2. Frequency of character in string
3. Check Palindrome
4. Check String is subsequence of other or not
5. Check for Anagram
6. Left Most Repeat
7. Right Most Repeat
8. 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

1. Implementation :
   a. Array Implementation
   b. Vector Implementation
   c. STL Implementation
   d. Linked List Implementation
2. Balanced Paranthesis
3. Two Stack in an Array

Tree

1. Implementation
2. Transversal a. Breadth first