Tags: #◇Computer Science #◇CSALGCM #◇Algorithms and Complexity #◇HackerRank #◇Problem Sets
Fool Arcana Problem Set — Index
[!note] What is the Fool Arcana?
In CSALGCM, HackerRank problem sets are themed around Tarot Arcana. The Fool Arcana is the introductory set — designed to build fluency with the HackerRank platform, C++ I/O boilerplate, and fundamental problem-solving patterns. Each problem has its own dedicated note with a full explanation.
◇Problem List
| # | Problem | Key Concept | Status |
|---|---|---|---|
| 01 | ◇01 - Solve Me First | Function completion, basic I/O | Solved |
| 02 | ◇02 - Simple Array Sum | Linear scan aggregation | Solved |
| 03 | ◇03 - Mini-Max Sum | Single-pass min/max + long long overflow | Solved |
| 04 | ◇04 - CamelCase | Linear scan counter | Solved |
| 05 | ◇05 - Library Fine | Cascading conditionals | Solved |
| 06 | ◇06 - Minimum Distances | Hash map (last-seen pattern) | Solved |
| 07 | ◇07 - Repeated String | Quotient/remainder decomposition | Solved |
| 08 | ◇08 - Sherlock and Squares | Integer square root + float correction | Solved |
| 09 | ◇09 - Anagram | Frequency difference array | Solved |
| 10 | ◇10 - Circular Array Rotation | Modular index mapping | Solved |
◇Patterns Covered
- Linear scan with accumulator (02, 03)
- Linear scan with counter (04)
- Priority-ordered conditionals (05)
- Hash map: last-seen index (06)
- Quotient + remainder decomposition (07)
- Integer square root with floating-point correction (08)
- Frequency difference array (09)
- Inverse circular offset formula (10)
◇References & Navigation
- Related Notes: ◇Problems, Problem Types, and Algorithms, ◇Complexity Analysis, ◇Computational Thinking in Problem Solving
- Next Problem Set: ◇[PS] Magician Arcana