Competitive Programming Essentials, Master Algorithms

Competitive Programming Essentials, Master Algorithms, available at $89.99, has an average rating of 4.41, with 345 lectures, 152 quizzes, based on 2248 reviews, and has 21835 subscribers.

You will learn about Understand & implement important techniques in Competitive Programming Learn advanced techniques to optimise naive solutions Ace code-thons and online coding competitons on Codeforces, HackerRank Get ready for ACM-ICPC, Google Kickstart, CodeJam & more This course is ideal for individuals who are Intermediate-Advanced Programmers who want to improve problem solving or University or college students who want to dive deep into algorithms or Coding enthusiasts who want to sharpen problem solving skills or Students preparing for ACM-ICPC and other online competitions It is particularly useful for Intermediate-Advanced Programmers who want to improve problem solving or University or college students who want to dive deep into algorithms or Coding enthusiasts who want to sharpen problem solving skills or Students preparing for ACM-ICPC and other online competitions.

Enroll now: Competitive Programming Essentials, Master Algorithms

Summary

Title: Competitive Programming Essentials, Master Algorithms

Price: $89.99

Average Rating: 4.41

Number of Lectures: 345

Number of Quizzes: 152

Number of Published Lectures: 344

Number of Published Quizzes: 152

Number of Curriculum Items: 498

Number of Published Curriculum Objects: 496

Original Price: ₹7,900

Quality Status: approved

Status: Live

What You Will Learn

Understand & implement important techniques in Competitive Programming
Learn advanced techniques to optimise naive solutions
Ace code-thons and online coding competitons on Codeforces, HackerRank
Get ready for ACM-ICPC, Google Kickstart, CodeJam & more

Who Should Attend

Intermediate-Advanced Programmers who want to improve problem solving
University or college students who want to dive deep into algorithms
Coding enthusiasts who want to sharpen problem solving skills
Students preparing for ACM-ICPC and other online competitions

Target Audiences

Intermediate-Advanced Programmers who want to improve problem solving
University or college students who want to dive deep into algorithms
Coding enthusiasts who want to sharpen problem solving skills
Students preparing for ACM-ICPC and other online competitions

Equip yourself with essential programming techniques required for ACM-ICPC, Google CodeJam, Kickstart, Facebook HackerCup & more. Welcome to Competitive Programming Essentials – the ultimate specialisation on Algorithms for Competitive Coders!

The online Competitive Programming Essentials by Coding Minutes is a highly exhaustive & rigorous course on Competitive Programming. The 50+ hours course covers the breadth & depth of algorithmic programming starting from a recap of common data structures, and diving deep into essential and advanced algorithms.

The course structure is well-researched by instructors who not only Competitive Coders but have worked with companies like Google & Scaler. This course will help you to get a solid grip of fundamental concepts & comes with practice questions so that you sail through online coding challenges and code-athons with ease. The course is divided into 10 modules and 50 sections covering topics like Mathematics, Number Theory, Bitmasking, Inclusion-Exclusion, Meet in the Middle Techniques, Segment Trees, Fenwick Trees, Square Root Decomposition, Graph Algorithms, Shortest Paths, Game Theory, Pattern Matching, Binary Search, Greedy Techniques, Dynamic Programming and even more.

The problem setters of the course are Siddharth Singhal and Rajdeep Singh. Both are upcoming software developers at Microsoft and Razorpay respectively. They both exhibit excellent knowledge of Data Structures and Algorithms and are avid competitive programmers.

Many top companies like Google, Facebook, Amazon, Directi, CodeNation, Goldman Sachsetc encourage Competitive Programming and conduct coding competitions to hire smart people who can solve problems.

Course Highlights

Instructors from Google & Scaler Academy
50+ hours of high quality & structured content
In-depth coverage of all topics
Exhaustive Course Curriculum
Code Evaluation on Coding Exercises
Lifetime Access
Complimentary TA Doubt Support

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: Course Structure

Lecture 3: Exercise Solutions (C++/Java)

Lecture 4: Doubt Support

Lecture 5: IDE Environment Setup

Lecture 6: FAQ's

Chapter 2: Setting Up Sublime [Optional]

Lecture 1: Sublime Setup

Lecture 2: Adding Master Header File

Lecture 3: Escaping Online Judges

Lecture 4: Common Code Snippets

Lecture 5: Using Macros

Lecture 6: Example Code Explained

Chapter 3: Time / Space Complexity Analysis

Lecture 1: Space Time Complexity Introduction

Lecture 2: Experimental Analysis

Lecture 3: Big O Notation

Lecture 4: Nested Loops

Lecture 5: Note : Edit in Nested Loops – II

Lecture 6: Nested Loops – II

Lecture 7: Analysis of Bubble Sort

Lecture 8: Analayis of BInary Search

Lecture 9: Analysis of Merge Sort

Lecture 10: Avoiding TLE Errors

Lecture 11: Complexities for Worst Case AC

Chapter 4: Data Structures & STL Containers

Lecture 1: Data Structures & STL Containers Revisited

Lecture 2: Arrays in C++

Lecture 3: Array STL

Lecture 4: Vector STL

Lecture 5: Deque STL

Lecture 6: Stack STL

Lecture 7: Queue STL

Lecture 8: Priority Queue STL

Lecture 9: [Webinar] Hashing STL

Lecture 10: [Webinar] More on STL

Chapter 5: Bitmanipulation Basics

Lecture 1: Bitwise Operators

Lecture 2: Left Shift & Right Shift

Lecture 3: Odd Even

Lecture 4: Get ith Bit

Lecture 5: Clear ith Bit

Lecture 6: Set ith Bit

Lecture 7: Update ith Bit

Lecture 8: Clear Last i Bits

Lecture 9: Clear Range of Bits

Lecture 10: Replace Bits

Lecture 11: Two Power

Lecture 12: Count Bits

Lecture 13: Count Bits Hack

Lecture 14: Make it Binary

Chapter 6: Bitmanipulation Problems

Lecture 1: Unique Number – I

Lecture 2: Unique Number – I Code

Lecture 3: Unique Number – II

Lecture 4: Unique Number – II Code

Lecture 5: Unique Number – III

Lecture 6: Unique Number – III Code

Lecture 7: Finding Subsequences

Lecture 8: Finding Subsets Code

Lecture 9: Travelling Salesman Problem

Lecture 10: Travelling Salesman Intution

Lecture 11: Travelling Salesman Code

Lecture 12: Travelling Salesman – DP Optimisation

Chapter 7: Big Integers

Lecture 1: Welcome!

Lecture 2: Introduction to Big Integers

Lecture 3: Big Addition Concept

Lecture 4: Big Addition Code

Lecture 5: Array & Integer Multiplication

Lecture 6: Large Factorials

Lecture 7: Java Big Integer Class

Lecture 8: BigInteger Example

Lecture 9: Big Integers in Python

Lecture 10: Python's Handling of Big Integers

Lecture 11: Big Integer Challenge – Julka

Lecture 12: Big Integer Challenge Solution

Chapter 8: Linear Recurrences & Matrix Exponentiation

Lecture 1: Binary Exponentiation

Instructors

Prateek Narang
Instructor & Entrepreneur – Google, Coding Minutes, Scaler
Apaar Kamal
Software Engineer at Google
Coding Minutes
Pocket friendly way to learn with experts!

Rating Distribution

1 stars: 57 votes
2 stars: 49 votes
3 stars: 220 votes
4 stars: 669 votes
5 stars: 1254 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu