Algorithms and data structures · Intermediate
Find a target pair from two endpoints
Use sorted order to justify eliminating pairs, then distinguish duplicates, original indices and the single-item boundary.
Read and check your understanding →LAVACS KNOWLEDGE
Follow worked examples and complexity analysis to choose suitable algorithms and data structures.
50 articles · page 3 of 3
Algorithms and data structures · Intermediate
Use sorted order to justify eliminating pairs, then distinguish duplicates, original indices and the single-item boundary.
Read and check your understanding →Algorithms and data structures · Intermediate
Compare shortest sum intervals and longest distinct-character windows, including repair order and a negative-value counterexample.
Read and check your understanding →Use the knowledge map to find prerequisites, or follow a learning path in order.