📄️ Binary Search
Binary search is a search algorithm that finds the first (lowerbound) or last (upperbound) position of a target value within a sorted array.
📄️ Disjoint Set
The disjoint set is a data structure that keeps track of a partition of a set into disjoint (non-overlapping) subsets.
🗃️ Graph Search
3 items
🗃️ Strong Connected Components
2 items
📄️ String Hashing
🗃️ Convex Hull
5 items
📄️ Line Segment Intersection
This is a classical problem in computational geometry. Given a list of line segments, determine if any two of them intersect.
🗃️ Polygon Triangulation
3 items
🗃️ Point Location
2 items
🗃️ Voronoi Diagram
1 item
🗃️ 2D Range Query
4 items