idiotleon

Competitive Programming Syllabus

Geometry

• Graham Scan algorithm for Convex Hull O(n * log(n))
• Online construction of 3-D convex hull in O(n^2)
• Bentley Ottmann algorithm to list all intersection points of n line segments in O((n + I) * logn)
  • Suggested Reading - http://softsurfer.com/Archive/algorithm_0108/algorithm_0108.htm
• Rotating Calipers Technique
  • Suggested Reading - http://cgm.cs.mcgill.ca/~orm/rotcal.html

• Problems - Refer the article for a list of problems which can be solved using Rotating Calipers technique.

idiotleon

• Pre Sum (hash map)

  • 1. Two Sum
  • 15. 3Sum
  • 18. 4Sum
  • 410. Split Array Largest Sum
  • 560. Subarray Sum Equals K

• Calculation

idiotleon

• Pre Sum (hash map)

  • 1. Two Sum
  • 15. 3Sum
  • 18. 4Sum
  • 410. Split Array Largest Sum
  • 560. Subarray Sum Equals K

• Calculation