Index


Stacks

    Implement 2 stacks in a array
    Next Greater Element 
    Stack using queues

Queues

Recursion

    Subset Sum

Linked List

Bitwise

    Little Vs Big Endian
    Power set

Sorting

    1. Bubble Sort
    2. Insertion Sort
    3. Selection Sort
    4. Shell Sort
    5. Merge Sort
    6. Quick Sort 

Trees

Binary Tree Traversals

  1. PreOrder Traversal
  2. InOrder Traversal
  3. PostOrder Traversal
  4. Level Order Traversal
  5. Vertical Sum

Graphs

  1. Breadth First Search(BFS)
  2. Depth First Search(DFS)

Dynamic Programming

  1. Bottom-Up approach(Tabulation)
  2. Top-Down approach(Top-Down approach)

Comments

Post a Comment

Popular posts from this blog

Link List

#include "bits/stdc++.h" using namespace std; class Node { public: int data; Node *next; Node(int d) : data(d), next(NULL) {} }; class LinkedList { private: Node *head; public: LinkedList() : head(nullptr) {} ~LinkedList() { Node *curr = head; while(curr != NULL) { Node *nextNode = curr->next; delete curr; curr = nextNode; } } void insertAtHead(int data) { Node *tempNode = new Node(data); tempNode->next = head; head = tempNode; } void printList() { Node *currNode = head; if (currNode == nullptr) { cout data "; currNode = currNode->next; } cout data == key) { Node *tempNode = head; head = head->next; delete tempNode; return; } // 3. Delete last node Node *curr = head; Node *prev = nu...
Read more