Build the foundation in Algorithms and Data Structures to ace Competitive Programming & Coding Interviews
Build the foundation in Algorithms and Data Structures to ace Competitive Programming & Coding Interviews
What you'll 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
Requirements
Just basic knowledge of Python language (variables, loops, statements)
Description
This course is going to be your bible on solving each coding interview question and 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!
Overview
Section 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
Section 2: Nested Loops & Brute Force Algorithms
Lecture 16 Index Of Substring
Lecture 17 Longest Common Prefix Of Multiple Strings
Lecture 18 Repeated Substring Pattern
Lecture 19 Count Triangles - O(n^3)
Lecture 20 Max Sum Subarray - O(n^3)
Lecture 21 Max Sum Subarray - O(n^2)
Lecture 22 Sum Of Subarray Maximums - O(n^3)
Lecture 23 Sum Of Subarray Maximums - O(n^2)
Section 3: Recursion
Lecture 24 Recursive Array Sum
Lecture 25 Recursive Reverse String
Lecture 26 Generate Pattern
Lecture 27 Recursive First Occurence
Lecture 28 Flatten Multidimensional Array
Section 4: Backtracking
Lecture 29 Generate Subsets
Lecture 30 Generate Permutations
Lecture 31 Generate Parentheses
Lecture 32 Generate Valley Permutations
Lecture 33 Word Search
Section 5: Stacks
Lecture 34 Next Greater Element
Lecture 35 Reverse Substrings Between Parentheses
Lecture 36 Decode String
Lecture 37 Sum Of Subarray Maximums
Lecture 38 Remove K Digits
Section 6: Two Pointers & Sliding Window
Lecture 39 Merge 2 Sorted Arrays
Lecture 40 Dot Product Of Sparse Vectors
Lecture 41 Count Triangles - O(n^2)
Lecture 42 Longest Harmonious Subsequence - O(n^2)
Lecture 43 Longest Harmonious Subsequence - O(n)
Lecture 44 Count Submatrices With All Ones
Lecture 45 Subarray Of Given Sum (Positive Numbers)
Lecture 46 Palindromic Substrings - Solution 1
Lecture 47 Palindromic Substrings - Solution 2
Section 7: Partial Sums
Lecture 48 Maximum Sum Of 3 Non Overlapping Subarrays - O(n^3)
Lecture 49 Max Sum Of 3 Non Overlapping Subarrays - O(n^2)
Lecture 50 Max Sum Of 3 Non Overlapping Subarrays - O(n)
Section 8: Graphs
Lecture 51 DFS: Find If Path Exists In Graph
Lecture 52 BFS: Min Distance To Every Vertex
Lecture 53 Shortest Path With Alternating Colors
Lecture 54 Dijkstra's Algorithm
Lecture 55 Number Of Islands - Part 1
Lecture 56 Number Of Islands - Part 2
Lecture 57 Word Ladder - Solution 1
Lecture 58 Word Ladder - Solution 2 - Part 1
Lecture 59 Word ladder - Solution 2 - Part 2
Lecture 60 Word ladder - Solution 3 - Part 1
Lecture 61 Word ladder - Solution 3 - Part 2
Section 9: Hash Maps
Lecture 62 Ransom Note
Lecture 63 Isomorphic Strings
Lecture 64 Group Anagrams - Solution 2
Lecture 65 Number Of Distinct Values - Solution 2
Lecture 66 4Sum
Lecture 67 Subarray Of Given Sum
Section 10: Greedy
Lecture 68 Maximum Units On Truck
Lecture 69 Assign Cookies
Lecture 70 Max Profit Assigning Work
Lecture 71 Non-overlapping Intervals - Part 1
Lecture 72 Non-overlapping Intervals - Part 2
Lecture 73 Non overlapping Intervals - Part 3
Lecture 74 Meeting Rooms - Solution 1
Lecture 75 Meeting Rooms - Solution 2
Section 11: Linked Lists
Lecture 76 Copy List With Random Pointer - Solution 1
Lecture 77 Copy List With Random Pointer - Solution 2
Anyone wishing to crush Competitive Programming,Anyone wishing to get their dream job
https://www.udemy.com/course/the-bible-of-competititve-programming-part-2/

Free Download Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me

Links are Interchangeable - Single Extraction

Tags: Competititve, Programming, Coding, Interviews, Bible

Views 47 | Comments 0

Comments