Category
5.00(7)

Getting Started With Competitive Programming

Description

You have some programming experience and now want to take your skills to a new level? Learning algorithms and mastering algorithmic thinking is by far the most effective way of rapidly improving as a developer and problems solver.
You will learn the most interesting and useful algorithms in this course. For each algorithm or topic, I have given a concise explanation, example and implementation outline. Then it’s your turn to apply the new learned algorithm to solve real problems. For that, I hand-picked some practice coding questions and quizzes. When you struggle with an issue and need help, leave your doubts in the question/answer forum and I will answer your problems.

 

Sign up now and get started with competitive programming!

What Will I Learn?

  • -Learns to think the solution in a simplified and optimized manner
  • -Develops the ability to write code of tough problems of Graph
  • -Learns to pass edge cases involving the use of modulo properties
  • -Gain insights of Dynamic Programming
  • -Learns certain miscellaneous techniques to solve questions faster

Topics for this course

11 Lessons2h

Graphs

DFT9:47
BFT9:04
Kruskals9:10
Prims13:51
Minimum Spanning Trees7:39
Dijkstra Algorithm16:43
Must Solve Practise Questions
Graphs Quiz

Catalan

Dynamic Programming

Modulo

Kadanse

Miscellaneous

About the instructors

Divya Chakarwarti

Incoming Summer Analyst at Goldman Sachs | ICPC 2019 India Regionalist | Research Intern at IIT Delhi A PotterHead, Coffee Lover, and an Ambivert
5.00 (7 ratings)

1 Courses

191 students

Student Feedback

5.0

Total 7 Ratings

5
7 ratings
4
0 rating
3
0 rating
2
0 rating
1
0 rating
M

A well explained course. Great for revision of all topics before interviews

Great Course

M

Absolutely loved it!

A

So far it is an amazing learning experience

A

nice explanations of important algos

G

good course with proper explanation and implementation of code.

S

A great course for quick revision. Instructor knows the concept well.
In the middle of it and liking it till now

Free

Material Includes

  • Catalan Number
  • Graphs (DFS, BFS, Dijkstra, Krukshal, Prim)
  • DP (LIS, LCS)
  • Modulo Properties
  • Kadane Algorithm

Requirements

  • -Write code while watching the videos.
  • -Note down the key points of the algorithms in notepad to revise later.
  • -Think and search for more ways to solve the same problem.
  • -Practice Practice and Practice. Its the only key.

Target Audience

  • -Beginners - who are eager to learn advance Data Structures
  • -Intermediate Level Coders - who already know the basics and want to increase rating on websites.
  • -Students who want to revise their concepts for interviews