Skip to content

README.md

Latest commit

 

History

History
58 lines (41 loc) · 5.72 KB

README.md

File metadata and controls

58 lines (41 loc) · 5.72 KB

Data Structures and Algorithms in Python

In this repository different types of Data Structures and Algorithms have been implemented in Python. And solutions of different Problems based on these topics are also included.

Data Structures

  1. Linked List: Code
  2. Queue using Linked List: Code
  3. Stack: Code, Solved Problems: Paranthesis Balancing
  4. Disjoint Set: Code
  5. Heap and Priority Que: Code
  6. Binary Search Tree using Linked List: Code
  7. Segment Tree: Code, Solved Promlems: Minimum value
  8. Trie Code

Algorithms

Searching

  1. Binary Search: Code

Sorting: Code

All the following Sorting algorithms have been implemented.

  1. Insertion Sort
  2. Selection Sort
  3. Buuble Sort
  4. Merge Sort
  5. Counting Sort (something self made 😉)

Backtracking

Solved Problems: Permutation Generator, Cobmination Generator, NQuneens Problem

Graph-Theory

  1. BFS: Code Solved Problems: Depth of Nodes, BFS in 2D grid, knight Moves, Bicoloring
  2. Minimum Spanning Tree(Kruskal Algorithm): Code
  3. Topological Sort: Code
  4. DFS: Code, Solved Problems: Cycle Detection
  5. Dijakstra: Code
  6. Articulation Point: Code, Solved Problems:Network, Submerged
  7. Strongly Conncted Components Code
  8. Maximum Flow(Ford Fulkerson) Code,

Dynamic Programming

  1. 1/0 Knapsack Problem (Code)
  2. Coin Change (Code)
  3. Longest Increasing Sequence (Code)
  4. Minimum Vertex Cover (Code)
  5. Longest Common Subsequence

CommonInterview Problems

In this section some of the common interview questions are added with the Online Judge links. (Link)