B Problems
This collection contains competitive programming problems organized by algorithmic topics across 19 sessions plus a final exam.
Sessions
| Topic | Description |
|---|---|
| Dynamic Array | Array manipulation and basic data structures |
| Algorithmic Complexity | Time and space complexity analysis |
| Sorting | Sorting algorithms and applications |
| Stack and Queue | Linear data structures |
| String | String manipulation and pattern matching |
| BFS | Breadth-first search traversal |
| DFS | Depth-first search traversal |
| Heap | Priority queue and heap operations |
| Dijkstra | Shortest path algorithm |
| Mid Term | Midterm exam problems |
| Bellman-Ford | Shortest path with negative weights |
| Floyd-Warshall | All-pairs shortest path |
| Binary Search | Binary search techniques |
| Binary Search Tree | BST operations and applications |
| MAP - TREEMAP - DICT | Map-based data structures |
| Prim | Minimum spanning tree |
| Trie | Prefix tree data structure |
| DSU | Disjoint Set Union (Union-Find) |
| Kruskal | MST using Kruskal’s algorithm |
| Final Exam | Final examination problems |
Topics Covered
- Data Structures: Arrays, Stacks, Queues, Heaps, Trees, Tries, DSU
- Graph Algorithms: BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim, Kruskal
- Searching: Binary Search, BST operations
- String Processing: String manipulation and algorithms