Competititve Programming Coding Interviews Python

Competititve Programming & Coding Interviews – Python, available at $84.99, has an average rating of 4.75, with 77 lectures, based on 13 reviews, and has 302 subscribers.

You will learn about Build a solid foundation to become a Competitive Programming wizard Master revolutionary data structures and various types of problems using each of them Learn fundamental algorithms and solve classical problems Get ready for Codeforces, CodeChef, Hackerrank, ACM-ICPC and more This course is ideal for individuals who are Anyone wishing to crush Competitive Programming or Anyone wishing to get their dream job It is particularly useful for Anyone wishing to crush Competitive Programming or Anyone wishing to get their dream job.

Enroll now: Competititve Programming & Coding Interviews – Python

Summary

Title: Competititve Programming & Coding Interviews – Python

Price: $84.99

Average Rating: 4.75

Number of Lectures: 77

Number of Published Lectures: 77

Number of Curriculum Items: 77

Number of Published Curriculum Objects: 77

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

Build a solid foundation to become a Competitive Programming wizard

Master revolutionary data structures and various types of problems using each of them

Learn fundamental algorithms and solve classical problems

Get ready for Codeforces, CodeChef, Hackerrank, ACM-ICPC and more

Who Should Attend

Anyone wishing to crush Competitive Programming

Anyone wishing to get their dream job

Target Audiences

Anyone wishing to crush Competitive Programming

Anyone wishing to get their dream job

This course is going to be your bible on solving each coding interview questionand competitive programming challenge. The content is based on my 9 year experience of struggling to find and solve a wide range of problems and develop the system for mastering this skill. I cover the exact same content that has helped my students’ performance skyrocket and got them offers at top companies like Google, Facebook and Amazon and solid results in the International Competitive Programming Contests.

Here’s what make this course amazing:

I guide you through the line of my thought when solving each problem, focusing on building the general approach for any type of problem you can encounter in competitive programming contests or coding interviews.

You will learn all the theory needed, but our main focus here is on practical applications.

I share with you problem solving tricks and good coding practices that took me years and hundreds of problems to figure out.

It’s interactive and engaging: I try to keep the theory as simple and natural as possible and we work as a team in solving any problem.

Do you think it’s finally the time to get the Software Developer Job or the results in Competitive Programming you deserve? Follow me!

Course Curriculum

Chapter 1: Arrays, Strings & Sorting

Lecture 1: Longest Common Prefix

Lecture 2: Maximum Value And Number Of Occurences

Lecture 3: Maximum Consecutive Ones

Lecture 4: Majority Element

Lecture 5: Number Of Distinct Values – Solution 1

Lecture 6: Single Number

Lecture 7: Find Duplicates

Lecture 8: Find Second Largest – O(n log n)

Lecture 9: Find Second Largest

Lecture 10: Group Anagrams

Lecture 11: Count Binary Substrings

Lecture 12: Rotate One To Right

Lecture 13: Minimum Absolute Difference

Lecture 14: Best Time To Buy And Sell One Stock

Lecture 15: Increasing Triplet

Chapter 2: Nested Loops & Brute Force Algorithms

Lecture 1: Index Of Substring

Lecture 2: Longest Common Prefix Of Multiple Strings

Lecture 3: Repeated Substring Pattern

Lecture 4: Count Triangles – O(n^3)

Lecture 5: Max Sum Subarray – O(n^3)

Lecture 6: Max Sum Subarray – O(n^2)

Lecture 7: Sum Of Subarray Maximums – O(n^3)

Lecture 8: Sum Of Subarray Maximums – O(n^2)

Chapter 3: Recursion

Lecture 1: Recursive Array Sum

Lecture 2: Recursive Reverse String

Lecture 3: Generate Pattern

Lecture 4: Recursive First Occurence

Lecture 5: Flatten Multidimensional Array

Chapter 4: Backtracking

Lecture 1: Generate Subsets

Lecture 2: Generate Permutations

Lecture 3: Generate Parentheses

Lecture 4: Generate Valley Permutations

Lecture 5: Word Search

Chapter 5: Stacks

Lecture 1: Next Greater Element

Lecture 2: Reverse Substrings Between Parentheses

Lecture 3: Decode String

Lecture 4: Sum Of Subarray Maximums

Lecture 5: Remove K Digits

Chapter 6: Two Pointers & Sliding Window

Lecture 1: Merge 2 Sorted Arrays

Lecture 2: Dot Product Of Sparse Vectors

Lecture 3: Count Triangles – O(n^2)

Lecture 4: Longest Harmonious Subsequence – O(n^2)

Lecture 5: Longest Harmonious Subsequence – O(n)

Lecture 6: Count Submatrices With All Ones

Lecture 7: Subarray Of Given Sum (Positive Numbers)

Lecture 8: Palindromic Substrings – Solution 1

Lecture 9: Palindromic Substrings – Solution 2

Chapter 7: Partial Sums

Lecture 1: Maximum Sum Of 3 Non Overlapping Subarrays – O(n^3)

Lecture 2: Max Sum Of 3 Non Overlapping Subarrays – O(n^2)

Lecture 3: Max Sum Of 3 Non Overlapping Subarrays – O(n)

Chapter 8: Graphs

Lecture 1: DFS: Find If Path Exists In Graph

Lecture 2: BFS: Min Distance To Every Vertex

Lecture 3: Shortest Path With Alternating Colors

Lecture 4: Dijkstras Algorithm

Lecture 5: Number Of Islands – Part 1

Lecture 6: Number Of Islands – Part 2

Lecture 7: Word Ladder – Solution 1

Lecture 8: Word Ladder – Solution 2 – Part 1

Lecture 9: Word ladder – Solution 2 – Part 2

Lecture 10: Word ladder – Solution 3 – Part 1

Lecture 11: Word ladder – Solution 3 – Part 2

Chapter 9: Hash Maps

Lecture 1: Ransom Note

Lecture 2: Isomorphic Strings

Lecture 3: Group Anagrams – Solution 2

Lecture 4: Number Of Distinct Values – Solution 2

Lecture 5: 4Sum

Lecture 6: Subarray Of Given Sum

Chapter 10: Greedy

Lecture 1: Maximum Units On Truck

Lecture 2: Assign Cookies

Lecture 3: Max Profit Assigning Work

Lecture 4: Non-overlapping Intervals – Part 1

Lecture 5: Non-overlapping Intervals – Part 2

Lecture 6: Non overlapping Intervals – Part 3

Lecture 7: Meeting Rooms – Solution 1

Lecture 8: Meeting Rooms – Solution 2

Chapter 11: Linked Lists

Lecture 1: Copy List With Random Pointer – Solution 1

Lecture 2: Copy List With Random Pointer – Solution 2

Instructors

Andrei Chiriac
Competitive Programming and Technical Interviews Instructor

Rating Distribution

1 stars: 0 votes

2 stars: 0 votes

3 stars: 1 votes

4 stars: 2 votes

5 stars: 10 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!