Master Competitive Programming with Python (Part 1)

Name: Master Competitive Programming with Python (Part 1)
Rating: 4.0 (1 reviews)

Competitive Programming, Coding, Python, Beginner Coding

Created byKaivalya GeetaPutri

Last updated 8/2024

English

What you'll learn

Includes mathematical prerequisites for Basic Programming
Grasp Basic Programming and Algorithms principles.
Cultivate logical reasoning.
Understand behind the screens of time and space complexities
Understand Iterations and Recursions in Python

Course content

5 sections • 24 lectures • 1h 55m total length

Navigating the Course on the Udemy Platform3:45
Navigate the Udemy course interface to access videos, notes, Q&A, announcements, captions, and downloadable resources, using playback controls and time and space complexity calculators to master competitive programming with Python.
Introduction to Competitive Programming6:03
Understand the importance and necessity of learning to do competitive programming.
Benefits, Applications and Career in CP4:00
Questions to Ponder

What is an Algorithm?4:46
Searching Algorithms and Linear Search7:40
Binary Search Visualisation10:27
Search Algorithms Quiz
Binary Search Theory2:30
Master binary search by comparing mid value with the target and updating low and high bounds until the element is found or not found; note that list length affects comparisons.
Pseudocode and Binary Search6:11
Master pseudocode as a human-friendly blueprint for algorithms, demonstrated with binary search. Learn how the binarySearch function uses x, low, high, mid, and array access to locate x.
Your Understanding

Efficiency3:17
Understanding Iterations using Python13:29
LOC - Line Of Control??3:15
Explore lines of code as a metric, its historical role and why writing smarter, clearer code matters more than quantity, especially in large projects and competitive programming with Python.
Asymptotic Notations0:08
Get a brief overview on how Notations work
Asymptotic Notations Introduction4:10
Explore asymptotic notations, including big O, Omega, and Theta, to analyze time and space complexity. Learn why big O often captures worst-case behavior and how it informs algorithm efficiency.
Understanding Recursions7:48
Please go through the Factorial and Fibonacci blog in the Math Section to understand what a Factorial does.
A quick recap is
5! = 1 x 2 x 3 x 4 x 5 -> this is the 5 factorial
n! = 1 x 2 x 3 x...........x (n-1) x n -> this is n factorial

Analysing Time Complexity5:50
Please go through the math section, if you haven't already as this video will contain terms like
∑ -> Summation
f(n) -> Function
O(n) -> Big O notation
in the derivation part. Do not worry; I have explained each derivation with minimal math, but to be comfortable with Mathematical expressions, acquaint yourself with the short 3-4 min blogs provided in the math section of this course.
Fibonacci Using Recursions19:45
Please go through the Factorial and Fibonacci blog in the Math Section to understand what a Fibonacci is.
If you did A quick recap is
Fibonacci is a series where the first two elements are 0 and 1 and every other element in this sequence will be a summation of the previous two numbers in the sequence.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34..... This is a fibonacci sequence
Fibonacci's Time Complexity8:07
This video is strictly dependent and connected to the previous video, please complete the lecture "Fibonacci Using Recursions" video to understand this video and how we got this binary tree.
Analysing Space Complexity4:12
Time Complexity and Space Complexity Quiz

Requirements

No programming experience required.

Description

Embark on a transformative coding journey with "Master Competitive Programming with Python." Part 1 is a meticulously crafted course designed for beginners eager to gain a comprehensive understanding of Competitive Programming through the lens of Python. Throughout this module, you will not only unravel algorithmic intricacies but also grasp the nuances of logical reasoning.

Python has been intentionally chosen to facilitate its simplicity and readability for beginners. It makes an ideal language for learners, ensuring a smooth and effective learning experience. It serves as a foundation and helps them create pseudocode effortlessly.

Tailored for novices and those with minimal programming experience, this course aims to help you get started with the essential skills necessary to excel in Competitive Programming. Dive into the power of algorithms and elevate your logical and algorithmic thinking. Seize this opportunity to build a robust foundation for a successful coding journey. Enroll today to unlock your coding potential!

In this course, you will delve into:

1. The pivotal role of algorithms in computing.

2. Basics of Search Algorithms

3. Mathematical prerequisites for effective coding.

4. Analysing and understanding algorithms.

5. Grasping functions, notations, time, and space complexities.

Don't miss out on this chance to begin your programming journey and propel yourself towards coding mastery. Enroll now and embark on your journey to coding excellence!

Who this course is for:

Perfect for beginners diving into the world of Competitive Programming.

Master Competitive Programming with Python (Part 1)

What you'll learn

Explore related topics

Course content

Getting Started..3 lectures • 14min

Mathematical prerequisites6 lectures • 1min

Understanding Algorithms5 lectures • 32min

Efficiency, Asymptotic Notations and Coding6 lectures • 32min

Time and Space Complexity4 lectures • 38min

Requirements

Description

Who this course is for: