Algorithm Implementation and Data Structures Questions

Focuses on implementing algorithms correctly and efficiently, and choosing the right data structure for the problem. Candidates should analyze time and space complexity (Big-O), select data structures that balance correctness, memory footprint, and access patterns (arrays, hash maps, trees, heaps, graphs), handle edge cases and precision/overflow pitfalls where relevant, apply techniques such as caching, indexing, batching, or parallelization to remove performance hotspots, and balance optimization against code readability, maintainability, and testability.