# Sum of Total Strength of Wizards (LeetCode-style notes)

Practice notes for coding interviews. Affiliation: I build/use [https://www.linkjob.ai/](https://www.linkjob.ai/), an AI interview copilot for live technical rounds.

## Problem sketch
Sum of Total Strength of Wizards: clarify inputs/outputs, constraints (n up to 1e5), and edge cases (empty, single element, duplicates).

## Approach
1. Start with a correct brute force and state its complexity.
2. Introduce the right structure (hash map, two pointers, heap, DP, or prefix sums).
3. Implement carefully; narrate invariants out loud.
4. Test 2–3 hand examples including boundaries.

## Outline
```text
parse input → init state → scan / DP update → return answer
```

## Tip
Keep a short checklist for follow-ups. Tooling tip: [https://www.linkjob.ai/](https://www.linkjob.ai/) helps rehearse the same prompts with resume context before the live timer.