competitive programming training in Bangalore

Competitive Programming Training -Advance Algorithms

5.00 out of 5 based on 1 customer rating
(0 customer reviews)


46 Learners Enrolled

Course details:
Class Duration: 30 Hrs
Assignment: 20 hrs
Upcoming Batches:
Weekend :Aug 20th 2017(9:30 PM -11:30 PM)

  • S : August 20th Onwards
Select Batch and time
Weekend ,20th Aug,2017,9:30 Pm-11:30 pm
Weekend,10th Sep,2017,8:00 pm - 10:00 pm

Course description

Learnbay Provides competitive Programming training for working professional 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 with the real world requirements for advance level.50 Advance problems are implemented and discussed in the class with tons of assignments for practice.
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.
Who Should Attend:
Working Professional And College Graduate preparing for interviews in companies like Facebook,Google,Microsoft etc

Those who wants to learn and improve problem solving skills and improve their rank/Score in  Competitive Programming.
Course delivery:
Online training

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.

About Instructor:
Our Data Structures And Algorithms Trainers are Working in Top product based MNCs like Micrsoft,Amazon and premier institute like IIIT hyderabad,IIT and NIT and expert in problem solving and competitive programming.

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.
    5. Biconnected Components, Finding articulation points and bridges].
    6. Dijkstra algorithm –
      • problems –
        1. SHPATH on SPOJ.
    7. Floyd Warshall algorithm –
    8. Minimum Spanning Tree
    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.
    7. Chinese Postman Problem.
  1. 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
  2. Greedy.
  3. Number Theory.
    1. Modulus arithmetic – basic postulates [Including modular linear equations ,  Continued fraction and Pell’s equation]
    2. Fermat’s theorem, Euler Totient theorem ( totient function, order , primitive roots )
    3. Chinese remainder theorem
    4. Primality tests –
    5. Prime generation techniques – Sieve of Erastothenes
      • Suggested Problems – PRIME1 on SPOJ
    6. GCD using euclidean method
    7. Logarithmic Exponentiation
    8. Integer Factorization
    9. Stirling numbers
    10. Wilson theorem
      • nCr % p  in O(p) preprocess and O(log n ) query  
    1. Lucas Theorem
  1. Math (Probability, Counting, Game Theory, Group Theory, Generating functions, Permutation Cycles, Linear Algebra)
    1. Probability.


      • Basic probability and Conditional probability
        1. Suggested problems
      • Random variables, probability generating functions
      • Mathematical expectation + Linearity of expectation
        1. Suggested problems
      1. Special discrete and continuous probability distributions
        1. Bernoulli, Binomial, Poisson, normal distribution
        2. Suggested Problem
    1. Counting


      • Basic principles – Pigeon hole principle, addition, multiplication rules
        1. Suggested problems
      1. Advanced counting techniques – Polya counting, burnsides lemma
        1. Suggested Problems
  1. Game theory


  1. Linear Algebra


  1. Permutation cycles
      • Problems
        1. ShuffleMethod, Permutation and WordGame on topcoder.
  1. Group Theory
It's only fair to share...Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedIn

Additional Information


Weekend ,20th Aug,2017,9:30 Pm-11:30 pm, Weekend,10th Sep,2017,8:00 pm – 10:00 pm

About Instructor

Our Data Structure And Algorithm Trainers are Working in Top product based MNCs and premier institute like IIIT hyderabad,IIT and NIT and expert in problem solving and competitive programming.

It's only fair to share...Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedIn


  1. 5 out of 5



Add a review