Magician Arcana
Tags: #◇CSALGCM #◇Problem Sets #◇HackerRank #◇Algorithms
A set of HackerRank problems covering core data structures: BFS graphs, linked lists, heaps, trees, queues, arrays, and strings. Each problem is a separate note.
| # | Problem | Domain | Difficulty | Status |
|---|---|---|---|---|
| 01 | ◇BFS: Shortest Reach | Graphs | Medium | |
| 02 | ◇Cycle Detection | Linked Lists | Medium | |
| 03 | ◇Find the Running Median | Heaps | Hard | |
| 04 | ◇Is This a BST? | Trees | Medium | |
| 05 | ◇Queue Using Two Stacks | Queues | Medium | |
| 06 | ◇Sherlock and Array | Arrays | Easy | |
| 07 | ◇Sparse Arrays | Strings | Medium | |
| 08 | ◇Tree: Preorder Traversal | Trees | Easy |
◇References & Navigation
- Previous Problem Set: ◇[PS] Fool Arcana
- Related Notes: ◇Problems, Problem Types, and Algorithms
- Next Problem Set: ◇[PS] Priestess Arcana