Here are all the video lectures from the Indian Programming Camp 2016.

- Biconnectivity By Tanuj Khattar
- Discrete Fourier Transforms By Kevin Charles Atienza
- Chinese Remainder Theorem by Praveen Dhinwa
- Posets Mirsky’s Theorem and Dilworth’s Theorem By Arjun Arul
- Path Problem By Akashdeep Nain
- Mini–cut By Anudeep Nekkanti
- Yate’s Dp, Zeta and Mobius Transforms By Arjun Arul
- Algebra By Kevin Charles Atienza
- Combinatorics By Kevin Charles Atienza
- Number Theory and Mobius Inversions By Kevin Charles Atienza
- Dynamic Connectivity Problems and Their Applications By Sergey Kulik
- Aho Corasick Algorithm and Applications By Sergey Kulik
- Geometry and Number Theory By Kevin Charles Atienza
- Merge Sort Tree and Persistence in Data Structures By Sergey Kulik
- Square Root Decompositions By Sergey Kulik

Enjoy the lectures and share them among your friends and families.

Rudreshwar

Team CodeChef

Where’s Square root decomposition by anudeep?

Square root decomposition video contains the video for Merge Sort and Persistence in Data Structure. Please upload the video for square root decomposition.

You can also go to their Youtube page and then see the playlist to find that Sqr Root video 🙂

are these lectures suitable for beginners ?

Nope

Dijkstra’s algorithm essentially uses breadth first search with greedy approach to come up with the shortest distance between given two nodes. Here is the better explanation of the Dijkstra’s shortest path algorithm. http://www.ideserve.co.in/learn/dijkstra-shortest-path-algorithm

Source :Learn javafx here http://javafxtuts.com/javafx-button-css/

love it..