Pradeepvarma_22 pradeepvarma22

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.

Tips from from an expert competitive programmer (Anudeep Nekkanti) for someone beginning competitive coding:

If I aim to start programming now, I would do it this way:

Solve 200 most solved problems on SPOJ, Problem by problem. In 2 months. (This will teach all standard problems, algorithms and implementation skills)
Solve problems from CodeChef and CodeForces for 2 months. (This will teach variations, we can read others solutions and learn better ways. Skip easy problems)
Solve problems from TopCoder for 2 months. (This will teach Dynamic Programming. Div 1 500p)

	First go here:

	https://wiki.codeaurora.org/xwiki/bin/QAEP/release

	This site gives information about all msm soc release details with tag + android version

	Search your msm here.. Check the latest one and look for correct android version and mark that tag.

	Now open one of the following links (dependent on your linux kernel version)

	#include<bits/stdc++.h>
	using namespace std ;

	// Nth number of FIBONACCI SEQUENCE
	// Bruteforce = 2^n , O(1) space
	// Top down = O(N) Time , O(N) space
	// Bottom up = O(N) Time , O(1) Space
	// Math Solution = O(1) Time and Space

	int totalCalls = 0 ;

	First go here:

	https://wiki.codeaurora.org/xwiki/bin/QAEP/release

	This site gives information about all msm soc release details with tag + android version

	Search your msm here.. Check the latest one and look for correct android version and mark that tag.

	Now open one of the following links (dependent on your linux kernel version)

	/* Queue - Circular Array implementation in C++*/
	#include<iostream>
	using namespace std;
	#define MAX_SIZE 101 //maximum size of the array that will store Queue.

	// Creating a class named Queue.
	class Queue
	{
	private:
	int A[MAX_SIZE];