vs4vijay

{
  "blacklist_regex": "(?i).*[^a-z](password|otp|verification|activation|passcode)[^a-z].*",
  "min_app_version": "131",
  "rules": [
    {
      "name": "Airtel",
      "telco": true,
      "patterns": [
        {
          "regex": "(?i)Bill.*\\sfor\\sRs.\\s?([\\d,\\,]*(?:.\\d{2})?).*mobile\\s?(\\d{10})?.*Due\\sDate:\\s?([\\d,\\-,A-Z]*)",

sharmaeklavya2

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.