Tayeeb Hasan flozender

Competitive Programming Syllabus

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.

I've deprecated this Gist and migrated the CER FAQ to my faculty webpage:

Feel free to submit pull requests on that file to make additions or corrections.

We couldn’t find that file to show.

	A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.

	An A::B program is a sequence of tokens. Example:

	B# A# #B #A B#

	To compute a program, we must rewrite neighbor tokens, using the rules:

	A# #A ... becomes ... nothing
	A# #B ... becomes ... #B A#


	When Invalid Host Header when ngrok tries to connect to Angular or React dev server use this form for run ngrok.

	ngrok http 8080 -host-header="localhost:8080"
	ngrok http --host-header=rewrite 8080