DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master computational geometry fundamentals — cross product for orientation testing, point-in-polygon detection, convex hull algorithms (Graham scan and Jarvis march), closest pair of points, line segment intersection, and applications in graphics and competitive programming.
Introduction
Computational geometry is the branch of computer science that studies algorithms for solving geometric problems — problems involving points, lines, polygons, and other geometric objects. It is fundamental to computer graphics, robotics, GIS (geographic information systems), and competitive programming.
The most powerful tool in computational geometry is the cross product, which tells you the orientation of three points (clockwise, counterclockwise, or collinear) in O(1) time.
The Cross Product — Core Tool
The 2D cross product of vectors (a, b) and (c, d) is: a×d - b×c
For three points P, Q, R:
| If result > 0 | R is to the LEFT of PQ (counterclockwise turn) |
| If result < 0 | R is to the RIGHT of PQ (clockwise turn) |
| If result = 0 | P, Q, R are COLLINEAR |
Example
def cross_product(O: Point, A: Point, B: Point) -> float:
"""
2D cross product of vectors OA and OB.
Returns:
> 0 if OAB makes a counterclockwise (left) turn
< 0 if OAB makes a clockwise (right) turn
= 0 if O, A, B are collinear
"""
return (A[0] - O[0]) * (B[1] - O[1]) - (A[1] - O[1]) * (B[0] - O[0])
# Test
P, Q, R = (0, 0), (1, 0), (0, 1)
print(cross_product(P, Q, R)) # 1 > 0 → counterclockwise
P, Q, R = (0, 0), (1, 0), (0, -1)
print(cross_product(P, Q, R)) # -1 < 0 → clockwise
P, Q, R = (0, 0), (1, 0), (2, 0)
print(cross_product(P, Q, R)) # 0 → collinear
Convex Hull — Graham Scan: O(n log n)
The convex hull is the smallest convex polygon that contains all the given points. Think of stretching a rubber band around all the points and letting it snap — the shape it forms is the convex hull.
Graham Scan algorithm:
- Find the bottom-most point (lowest y, leftmost if tie) — call it P0
- Sort all other points by polar angle relative to P0
- Process each point: maintain a stack where each turn is counterclockwise
- Pop clockwise turns — the remaining stack is the convex hull
Example
def convex_hull(points: List[Point]) -> List[Point]:
"""
Graham Scan convex hull algorithm.
Time: O(n log n) — dominated by sorting
Space: O(n)
Returns: List of hull vertices in counterclockwise order
"""
n = len(points)
if n <= 2:
return points
# Find bottom-most point (leftmost if tie)
pivot = min(points, key=lambda p: (p[1], p[0]))
def polar_angle_key(p):
"""Sort key: polar angle from pivot, then distance."""
if p == pivot:
return (float('-inf'), 0)
cp = cross_product(pivot, p, pivot) # Not useful here
# Compute angle using atan2
import math
angle = math.atan2(p[1] - pivot[1], p[0] - pivot[0])
dist = distance_sq(pivot, p)
return (angle, dist)
# Sort by polar angle
sorted_pts = sorted(points, key=polar_angle_key)
# Graham scan: build lower and upper hull
stack = []
for p in sorted_pts:
# While last three points make a clockwise or collinear turn, pop
while len(stack) >= 2 and cross_product(stack[-2], stack[-1], p) <= 0:
stack.pop()
stack.append(p)
return stack
# Alternative: using the monotone chain algorithm (more numerically stable)
def convex_hull_monotone(points: List[Point]) -> List[Point]:
"""
Monotone chain convex hull.
Builds lower and upper hulls separately.
Time: O(n log n), more numerically stable than Graham scan.
"""
points = sorted(set(points)) # Sort lexicographically, remove duplicates
if len(points) <= 1:
return points
# Build lower hull
lower = []
for p in points:
while len(lower) >= 2 and cross_product(lower[-2], lower[-1], p) <= 0:
lower.pop()
lower.append(p)
# Build upper hull
upper = []
for p in reversed(points):
while len(upper) >= 2 and cross_product(upper[-2], upper[-1], p) <= 0:
upper.pop()
upper.append(p)
# Concatenate (remove duplicate endpoints)
return lower[:-1] + upper[:-1]
points = [(0,0),(1,1),(2,2),(0,2),(2,0),(1,0),(0,1)]
hull = convex_hull_monotone(points)
print("Convex hull:", hull) # [(0,0),(2,0),(2,2),(0,2)]
Point in Polygon — Ray Casting: O(n)
Problem: Given a polygon and a point P, determine if P is inside the polygon.
Ray casting algorithm: Cast a ray from P in any direction (e.g., right). Count how many polygon edges it crosses. If odd → inside; if even → outside.
Example
def point_in_polygon(point: Point, polygon: List[Point]) -> bool:
"""
Ray casting algorithm.
Casts a horizontal ray to the right from point.
Counts intersections with polygon edges.
Time: O(n), Space: O(1)
"""
x, y = point
n = len(polygon)
inside = False
j = n - 1
for i in range(n):
xi, yi = polygon[i]
xj, yj = polygon[j]
# Does the ray from (x,y) going right intersect edge (xi,yi)-(xj,yj)?
if ((yi > y) != (yj > y)) and (x < (xj - xi) * (y - yi) / (yj - yi) + xi):
inside = not inside
j = i
return inside
# Test
square = [(0,0), (4,0), (4,4), (0,4)]
print(point_in_polygon((2, 2), square)) # True — inside
print(point_in_polygon((5, 2), square)) # False — outside
print(point_in_polygon((2, -1), square)) # False — below
triangle = [(0,0), (4,0), (2,4)]
print(point_in_polygon((2, 1), triangle)) # True
print(point_in_polygon((0, 3), triangle)) # False
Line Segment Intersection: O(1)
Problem: Do two line segments intersect?
Example
def segments_intersect(p1: Point, p2: Point, p3: Point, p4: Point) -> bool:
"""
Check if segment p1-p2 intersects segment p3-p4.
Uses cross product orientation tests.
Time: O(1)
"""
d1 = cross_product(p3, p4, p1)
d2 = cross_product(p3, p4, p2)
d3 = cross_product(p1, p2, p3)
d4 = cross_product(p1, p2, p4)
if ((d1 > 0 and d2 < 0) or (d1 < 0 and d2 > 0)) and \
((d3 > 0 and d4 < 0) or (d3 < 0 and d4 > 0)):
return True
# Collinear cases
def on_segment(p: Point, q: Point, r: Point) -> bool:
return (min(p[0], r[0]) <= q[0] <= max(p[0], r[0]) and
min(p[1], r[1]) <= q[1] <= max(p[1], r[1]))
if d1 == 0 and on_segment(p3, p1, p4): return True
if d2 == 0 and on_segment(p3, p2, p4): return True
if d3 == 0 and on_segment(p1, p3, p2): return True
if d4 == 0 and on_segment(p1, p4, p2): return True
return False
print(segments_intersect((0,0),(4,4),(0,4),(4,0))) # True — X-shaped
print(segments_intersect((0,0),(2,2),(3,3),(5,5))) # False — parallel/same line no overlap
print(segments_intersect((0,0),(1,1),(2,0),(3,1))) # False — parallel
Closest Pair of Points: O(n log n)
Problem: Given n points, find the pair with minimum distance.
Divide and conquer beats O(n²) brute force:
Example
def closest_pair(points: List[Point]) -> Tuple[float, Point, Point]:
"""
Find closest pair of points using divide and conquer.
Time: O(n log n), Space: O(n)
"""
def brute_force(pts):
min_dist = float('inf')
pair = None
for i in range(len(pts)):
for j in range(i+1, len(pts)):
d = distance(pts[i], pts[j])
if d < min_dist:
min_dist, pair = d, (pts[i], pts[j])
return min_dist, pair
def closest_rec(pts_sorted_x, pts_sorted_y):
n = len(pts_sorted_x)
if n <= 3:
return brute_force(pts_sorted_x)
mid = n // 2
mid_point = pts_sorted_x[mid]
left_x = pts_sorted_x[:mid]
right_x = pts_sorted_x[mid:]
left_y = [p for p in pts_sorted_y if p[0] <= mid_point[0]]
right_y = [p for p in pts_sorted_y if p[0] > mid_point[0]]
d_left, pair_left = closest_rec(left_x, left_y)
d_right, pair_right = closest_rec(right_x, right_y)
if d_left < d_right:
d, best_pair = d_left, pair_left
else:
d, best_pair = d_right, pair_right
# Check strip around the dividing line
strip = [p for p in pts_sorted_y if abs(p[0] - mid_point[0]) < d]
for i in range(len(strip)):
j = i + 1
while j < len(strip) and (strip[j][1] - strip[i][1]) < d:
dist = distance(strip[i], strip[j])
if dist < d:
d, best_pair = dist, (strip[i], strip[j])
j += 1
return d, best_pair
pts_x = sorted(points, key=lambda p: p[0])
pts_y = sorted(points, key=lambda p: p[1])
return closest_rec(pts_x, pts_y)
points = [(2,3),(12,30),(40,50),(5,1),(12,10),(3,4)]
dist, (p1, p2) = closest_pair(points)
print(f"Closest pair: {p1} and {p2}, distance: {dist:.4f}")
Polygon Area — Shoelace Formula: O(n)
Example
def polygon_area(polygon: List[Point]) -> float:
"""
Calculate area of polygon using the Shoelace formula.
Works for any simple (non-self-intersecting) polygon.
Returns positive area regardless of vertex order.
Time: O(n)
"""
n = len(polygon)
area = 0.0
for i in range(n):
j = (i + 1) % n
area += polygon[i][0] * polygon[j][1]
area -= polygon[j][0] * polygon[i][1]
return abs(area) / 2.0
square = [(0,0), (4,0), (4,4), (0,4)]
print(polygon_area(square)) # 16.0
triangle = [(0,0), (4,0), (0,3)]
print(polygon_area(triangle)) # 6.0
Applications
| Application | Algorithm | Complexity |
|---|---|---|
| Convex hull | Graham Scan / Monotone Chain | O(n log n) |
| Point in polygon | Ray casting | O(n) |
| Segment intersection | Cross product | O(1) per pair |
| Closest pair | Divide and conquer | O(n log n) |
| Polygon area | Shoelace formula | O(n) |
| All intersections | Sweep line (Bentley-Ottmann) | O((n+k) log n) |
Real-world uses:
- Computer graphics: collision detection, clipping, visibility
- GPS/Maps: polygon containment, route planning
- Robotics: obstacle avoidance, motion planning
- GIS: geographic queries, map overlays
Summary
Computational geometry problems are solved using a small set of fundamental tools:
- Cross product: Determines orientation (left/right/straight turn) of three points — the most important tool
- Convex hull: Smallest convex polygon containing all points — Graham Scan O(n log n)
- Point in polygon: Ray casting algorithm O(n)
- Segment intersection: Cross product orientation tests O(1)
- Closest pair: Divide and conquer O(n log n) — better than O(n²) brute force
- Polygon area: Shoelace formula O(n)
Master the cross product and orientation test — they underlie virtually every computational geometry algorithm.
*Advanced Topics section complete. All 8 files written.*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Computational Geometry — Points, Lines, Convex Hull, and Geometric Algorithms.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, advanced, topics, computational
Related Data Structures & Algorithms Topics
Continue learning this concept
Advanced TopicsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsMaster bit manipulation completely — bitwise operators with truth tables, bit shifting, common tricks for setting/clearing/toggling bits, XOR magic properties, counting set bits (Brian Kernighan), power of two checks, swap without temp variable, and 15 classic interview problems solved with bit manipulation.Advanced TopicsBloom Filter — Space-Efficient Probabilistic Membership TestingMaster Bloom filters — what they are, how multiple hash functions create a probabilistic set, false positive analysis and optimal parameter calculation, complete implementation, applications in databases and networking, and counting Bloom filters for deletion support.Advanced TopicsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankMaster Disjoint Set Union (Union-Find) completely — what it is, naive implementation, path compression optimization, union by rank, combined O(α(n)) amortized complexity, KruskalAdvanced TopicsRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesMaster randomized algorithms — the difference between Las Vegas and Monte Carlo algorithms, randomized quicksort with expected O(n log n), reservoir sampling for streaming data, randomized selection for kth element, Miller-Rabin primality test, and why randomization defeats adversarial inputs.Advanced TopicsSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsMaster skip lists — what they are, how probabilistic layering achieves O(log n) expected search, complete implementation with insert/search/delete, why Redis and LevelDB use skip lists instead of balanced trees, and comparison with AVL trees and hash maps.Advanced TopicsSuffix Array — Construction, LCP Array, and String Search ApplicationsMaster suffix arrays — what a suffix array is, how to build it using simple and O(n log n) algorithms, the LCP (Longest Common Prefix) array, how to use suffix arrays for pattern searching in O(m log n), finding the longest repeated substring, and counting distinct substrings.