Integer Partitions and N-Queens

[gaurav-behera]

What's Included

1. New Algorithm Module: Integer Partition
2. New Algorithm Module: N-Queens
3. New Algorithm Module: Closest Pair of Points
4. New Algorithm Module: Edit Distance
5. Documentation Integration
6. Updated main.typ

---

Why This Matters

• Brings four more classical computational problems into the mapcode framework, expanding coverage.
• Demonstrates the framework's versatility in handling both tensor-based DP problems and set-based recursive backtracking problems.
• Serves as additional templates for future algorithm additions.

---

Files Changed

• algorithms/integer_partition.typ — 128 lines added
• algorithms/n_queens.typ — 131 lines added
• algorithms/closest_pair_of_points.typ — 216 lines added
• algorithms/edit_distance.typ — 146 lines added
• main.typ — 8 lines added

No existing code modified; additions are isolated and non-breaking.

---

Checklist

• Builds successfully
• Renders correctly in main.typ
• Follows repository style and structure
• No backward-incompatible changes

---