Guacamole

Data Structure and Algorithms

“Bad programmers worry about the code. Good programmers worry about data structures and their relationships.” - Linus Torvalds

A list of Algorithms implemented within the project:

Dynamic Programming:

1. 0-1 Knapsack Problem
2. Unbounded Knapsack Problem
3. Longest Common Subsequence Problem
4. Shortest Common Supersequence Problem
5. Maximum Subarray Sum
6. Longest Palindromic Substring
7. Coin Change
8. Longest Increasing Subsequence Problem

Pattern Matching Algorithm:

1. Gusfield's Z-Algorithm
2. Rabin Karp Algorithm
3. Knuth-Morris-Pratt Algorithm
4. Boyer Moore Algorithm

Sorting Algorithm:

1. Counting Sort
2. Radix Sort
3. Merge Sort
4. Bucket Sort
5. Tim sort

Tree Data Structure:

1. Binary Search Tree
2. Red Black Tree
3. AVL Tree

Graph Traversal Algorithm:

1. Graph ADT
2. Depth First Search
3. Breadth First Search
4. Dijkstra Algorithm
5. Floyd-Warshall Algorithm

Minimum Spanning Tree:

1. Kruskal's Algorithm
2. Prim–Jarník Algorithm

Disjoint Set Data Structure:

1. Disjoint Set ADT

---

Competitive Programming Problems and Solutions