Competitive Programming Training -Advanced Algorithms 

Specially designed for working professionals to crack

interviews of big five

Class Duration: 30 Hrs

Mastering- Competitive Programming

Course description 

Learnbay Provides competitive Programming training for working professionals and

college graduate those who are interested to attend programming competition and
targeting for interviews in companies like Microsoft, Facebook, Google etc.

Our course content is designed by experts to match the real world requirements for
advanced level.50 Advance problems are implemented and discussed in the class with
tons of assignments for practice.

Prerequisites

Should have knowledge of data structures and Algorithms. This course covers the
advance problems only and you should know data structures and algorithms to attend
this session.

What will you Learn

This course will benefit you to perform your programming jobs better and also help you
to get to better positions, with confidence, in case you are looking out for jobs. This
course will help you to to handle Advance Algorithm based interview with more
confidence.
Course Content: 
List of Topics for programming Competitions-

1. Basic Geometry/Euclidean Geometry/Coordinate Geometry/ [3-D variants

of everything].
2. Computational Geometry.
1. Graham Scan Algorithm for Convex Hull O(n * log(n)).
2. Online construction of 3-D convex hull in O(n^2).
3. Bentley Ottmann algorithm to list all intersection points of n line
segments in O((n + I) * log
4. Rotating Calipers Technique.
5. Line Sweep/Plane Sweep algorithms –
■ Area/Perimeter of Union of Rectangles.
■ Closest pair of points.
6. Area of Union of Circles.
7. Delayunay Triangulation of n points in O(n * logn).
8. Voronoi Diagrams of n points in O(n * logn) using Fortunes
algorithm.
9. Point in a polygon problem –
■ O(n) solution without preprocessing.
■ O(logn) algorithm with O(n * logn) preprocessing for
convex polygons.
10. Problems on computational geometry
3. String Algorithm
1. KnuthMorrisPratt algorithm.
■ Problems – NHAY, PERIOD on SPOJ.
2. Aho Corasick algorithm.
■ Problems – WPUZZLES on SPOJ.
3. Suffix Arrays
■ O(n^2 * logn) Naive method of suffix array construction
■ O(n * logn^2) method of suffix array construction
■ O(n * logn) method of suffix array construction.
■ O(n) method of suffix array construction
■ O(n) LCA preprocess on Suffix Arrays to solve a
variety of string problems.
4. Suffix Trees
 ■ O(n) construction of Suffix trees using Ukkenon’s
algorithm.
■ O(n) construction of Suffix Trees if provided with Suffix
Arrays using Farach’s algorithm.
5. Suffix Automata
■ O(n) Suffix Automaton construction.
6. Dictionary Of Basic Factors
■ O(n * logn) method of DBF construction using Radix
Sort.
7. Manachar’s algorithm to find Lengh of palindromic substring of a
string centered at a position for each position in the string.
Runtime -> O(n).
8. Searching and preprocessing Regular Expressions consisting of
‘?’, ‘*’.
9. Multi-dimensional pattern matching.
4. Basic Graphs
1. Representation of graphs as adjacency list, adjacency matrix,
incidence matrix, and edge list and uses of different
representations in different scenarios.
2. Breadth-First Search.
3. Depth First Search.
4. Strongly Connected Components.
■ problems –
1. TOUR and BOTTOM on SPOJ.
5. Biconnected Components, Finding articulation points and
bridges].
■ problems –
1. RELINETS, PT07A on SPOJ.
6. Dijkstra algorithm –
■ problems –
1. SHPATH on SPOJ.
7. Floyd Warshall algorithm –
■ problems –
1. COURIER on SPOJ.
8. Minimum Spanning Tree
■ problems –
1. BLINNET on SPOJ.
9. Flood-fill algorithm
10. Topological sort
 11. Bellman-Ford algorithm.
12. Euler Tour/Path.
■ problems – WORDS1 on SPOJ.
5. Flow networks/ matching etc etc. [Interdiate/Advanced].
1. Maximum flow using Ford Fulkerson Method.
1. Maximum flow using Dinics Algorithm.
○ Problems – PROFIT on spoj.
1. Minimum Cost Maximum Flow.
■ Successive Shortest path algorithm.
■ Cycle Cancelling algorithm.
2. Maximum weighted Bipartite Matching (Kuhn Munkras
algorithm/Hungarian Method)
3. Stoer Wagner min-cut algorithm.
4. Hopcroft Karp bipartite matching algorithm.
■ problems – ANGELS on SPOJ.
5. Maximum matching in general graph (blossom shrinking)
6. Gomory-Hu Trees.
■ i) Problems – MCQUERY on Spoj.
7. Chinese Postman Problem.
2. Dynamic Programming.
1. Suggested Reading – Dynamic Programming(DP) as a
tabulation method
■ Cormen chapter on DP
2. Standard problems (you should really feel comfortable with these
types)
3. State space reduction
4. Solving in the reverse – easier characterizations looking from the
end
5. Counting/optimizing arrangements satisfying some specified
properties
6. Strategies and expected values
7. DP on probability spaces
8. DP on trees
9. DP with data structures
10. Symmetric characterization of DP state
11. A good collection of problems
3. Greedy.
4. Number Theory.
1. Modulus arithmetic – basic postulates [Including modular linear
equations, Continued fraction and Pell’s equation]
■ Problems
1. http://projecteuler.net/index.php?section=pro
blems&id=64
2. http://projecteuler.net/index.php?section=pro
blems&id=65
3. http://projecteuler.net/index.php?section=pro
blems&id=66
4. http://www.topcoder.com/stat?c=problem_st
atement&pm=6408&rd=9826
5. http://www.topcoder.com/stat?c=problem_st
atement&pm=2342
2. Fermat’s theorem, Euler Totient theorem ( totient function, order ,
primitive roots )
■ Problems
1. http://projecteuler.net/index.php?section=pro
blems&id=70
2. http://www.spoj.pl/problems/NDIVPHI/
3. Chinese remainder theorem
■ Problems
1. Project Euler 271
2. http://www.topcoder.com/stat?c=problem_st
atement&pm=10551&rd=13903
4. Primality tests –
■ Deterministic O(sqrt(n) ) approach
■ Probabilistic primality tests – Fermat primality test,
Miller-Rabin Primality test
1. Suggested Reading –
1. http://www.topcoder.com/tc?modul
e=Static&d1=tutorials&d2=primalit
yTesting
2. Cormen 31.8
3. 2.2 from Number Theory by SY
Yan
2. Problems –
1. PON, PRIC, SOLSTRAS on
SPOJ
 2. http://www.topcoder.com/stat?c=p
roblem_statement&pm=4515
5. Prime generation techniques – Sieve of Erastothenes
■ Suggested Problems – PRIME1 on SPOJ
6. GCD using euclidean method
■ Problems –
1. GCD on SPOJ
2. http://uva.onlinejudge.org/external/114/1142
4.html
7. Logarithmic Exponentiation
8. Integer Factorization
■ Naive O(sqrt(n)) method
■ Pollard Rho factorization
■ Problems –
1. http://www.topcoder.com/stat?c=problem_st
atement&pm=2986&rd=5862
2. http://www.spoj.pl/problems/DIVSUM2/
3. http://www.topcoder.com/stat?c=problem_st
atement&pm=4481&rd=6538
9. Stirling numbers
10. Wilson theorem
○ nCr % p in O(p) preprocess and O(log n ) query
1. Lucas Theorem