Udemy - LeetCode In Python: 50 Algorithms Coding Interview Questions https://www.udemy.com/course/leetcode-in-python-50-algorithms-coding-interview-questions/ Getting ready for your software engineering coding interview? This is the place for you.
Description Getting ready for your software engineering coding interview? This is the place for you.Want to learn about the most popular techniques, patterns, data structures and algorithms used in those difficult interviews? This is the place for you.Want a step by step explanation of 50 of the most popular interview questions in the industry? This is the place for you.Welcome to the course!In this course, you'll have a detailed, step by step explanation of 50 hand-picked LeetCode questions where you'll learn about the most popular techniques and problems used in the coding interview, This is the course I wish I had when I was doing my interviews.What is LeetCode?LeetCode is essentially a huge repository of real interview questions asked by the most popular tech companies ( Google, Amazon, Facebook, Microsoft and more ).The problem with LeetCode is also its advantage, IT'S HUGE, so huge in fact that interviewers from the most popular companies often directly ask questions they find on LeetCode, So it's hard to navigate through the huge amount of problems to find those that really matter, this is what this course is for.I spent countless hours on LeetCode and I'm telling you that you don't have to do the same and still be able to get a job at a major tech company.Course overview :In this course, I compiled 50 of the most important and the most popular interview questions asked by these major companies and I explain them, in a true STEP BY STEP fashion to help you understand exactly how to solve these types of questions.The problems are handpicked to ensure complete coverage of the most popular techniques, data structures, and algorithms used in interviews so you can generalize the patterns you learn here on other problems.Each problem gets 2 videos :Explanation video: we do a detailed explanation of the problems and its solution, this video will be longer because we will do a step by step explanation for the problems.Coding video: where we code the solution discussed in the explanation video together.We will use basic python for this course to code our solutions, previous knowledge in python is preferred but NOT required for the coding part of the course.The problems are categorized for easier navigation and will be regularly updated with more popular and interesting problems.Some of the stuff this course will cover are :Arrays and Strings.Searching.Dynamic Programming.Backtracking ( With step by step visualization ).Trees and Graphs.Data structures Like Stacks, Queues, Maps, Linked Lists, and more.In other words, this course is your one-stop-shop for your dream job. Who this course is for: Developers eager to pass the coding interview at huge companies like Google, Facebook, Microsoft, Amazon, etc. People who want to develop their problem solving skills. Developers getting ready for their interviews. Students getting ready for their internship interviews. Course contentIntroductionIntroductionHow to use this courseWhat to do if you don't understand an explanation or code video (Important)Utilize the video format of online coursesBig O Notation (OPTIONAL)Big O IntroductionBig O ExercisesFormalizing Big OBig O SimplificationSpace complexityLogarithmsBinary Search (OPTIONAL)Binary Search AlgorithmBinary Search ImplementationSliding Window (OPTIONAL)Sliding Window TechniqueSliding Window ImplementationArrays and Strings Interview QuestionsExplanation - Move Zeroes - Easy #283Code - Move Zeroes - Easy #283Explanation - Boats to Save People - Medium #881Code - Boats to Save People - Medium #881Explanation - Valid Mountain Array - Easy #941Code - Valid Mountain Array - Easy #941Explanation - Container With Most Water - Medium #11Code - Container With Most Water - Medium #11Explanation - First Bad Version - Easy #278Code - First Bad Version - Easy #278Explanation - Longest Substring Without Repeating Characters - Medium #3Code - Longest Substring Without Repeating Characters - Medium #3Explanation - Find First and Last Position of Element in Sorted Array-Medium #34Code - Find First and Last Position of Element in Sorted Array - Medium #34Math Interview QuestionsExplanation - Missing Number - Easy #268Code - Missing Number - Easy #268Explanation - Count Primes - Easy #204Code - Count Primes - Easy #204Explanation - Single Number - Easy #136Code - Single Number - Easy #136Explanation - Robot Return to Origin - Easy #657Code - Robot Return to Origin - Easy #657Explanation - Add Binary - Easy #67Code - Add Binary - Easy #67Hash Tables (OPTIONAL)What are hash tables ?Collision handlingCollision handling techniques comparisonHash Tables/Maps Interview QuestionsExplanation - Two Sum - Easy #1Code - Two Sum - Easy #1Explanation - Contains Duplicate - Easy #217Code - Contains Duplicate - Easy #217Explanation - Majority Element - Easy #169Code - Majority Element - Easy #169Explanation - Group Anagrams - Medium #49Code - Group Anagrams - Medium #49Explanation - 4Sum II - Medium #454Code - 4Sum II - Medium #454Explanation - LRU Cache - Medium #146Code - LRU Cache - Medium #146Explanation - Minimum Window Substring - Hard #76Code - Minimum Window Substring - Hard #76Stacks and Queues (OPTIONAL)What are stacks ?Stack ImplementationWhat are queues ?Queues ImplementationStacks and Queues Interview QuestionsExplanation - Min Stack - Easy #155Code - Min Stack - Easy #155Explanation - Valid Parenthesis - Easy #20Code - Valid Parenthesis - Easy #20Explanation - Binary Tree Level Order Traversal - Medium #103Code - Binary Tree Level Order Traversal - Medium #103Explanation - Binary Tree Zigzag Level Order Traversal - Medium #103Code - Binary Tree Zigzag Level Order Traversal - Medium #103Explanation - Binary Tree Postorder Traversal - Hard #145Code - Binary Tree Postorder Traversal - Hard #145Linked Lists (OPTIONAL)What are Linked Lists ?Singly linked list creation implementationSingly linked list insertion implementationSingly linked list deletion implementationDoubly Linked ListsDoubly linked lists creation implementationDoubly linked lists insertion implementationDoubly linked list deletion implementationLinked Lists Interview QuestionsExplanation - Merge Two Sorted Lists - Easy #21Code - Merge Two Sorted Lists - Easy #21Explanation - Linked List Cycle - Easy #141Code - Linked List Cycle - Easy #141Explanation - Reverse Linked List - Easy #206Code - Reverse Linked List - Easy #206Explanation - Add Two Numbers - Medium #2Code - Add Two Numbers - Medium #2Explanation - Remove Nth Node From End of List - Medium #19Code - Remove Nth Node From End of List - Medium #19Explanation - Odd Even Linked List - Medium #328Code - Odd Even Linked List - Medium #328Explanation - Merge K Sorted Lists - Hard #23Code - Merge K Sorted Lists - Hard #23Backtracking / Recursion Interview QuestionsExplanation - Subsets - Medium #78Code - Subsets - Medium #78Explanation - Word Search - Medium #79Code - Word Search - Medium #79Explanation - Combination Sum - Medium #39Code - Combination Sum - Medium #39Explanation - Letter Combinations of a Phone Number - Medium #17Code - Letter Combinations of a Phone Number - Medium #17Explanation - Palindrome Partitioning - Medium #131Code - Palindrome Partitioning - Medium #131Graphs Introduction (OPTIONAL)What are Graphs ?Directed Graph Implementation - Adjacency ListDirected Graph Implementation - Adjacency MatrixUndirected Graph Implementation - Adjacency ListUndirected Graph Implementation - Adjacency MatrixDepth First Search (DFS) - OPTIONALDepth First Search (DFS)DFS implementationBreadth First Search (BFS) - OPTIONALBreadth First Search (BFS)BFS ImplementationDijkstra's Algorithm - OPTIONALDijkstra's AlgorithmExplanation - network delay time - Medium #743Code - network delay time - Medium #743Trees (OPTIONAL)What are trees ?Trees ImplementationTrees traversal techniques (in-order,pre-order,post-order)In-order traversal implementationPre-order traversal implementationPost-order traversal implementationBinary Search Trees (BST) - OPTIONALWhat is a binary search tree (BST)Binary Search tree creation and insertion implementationBinary search tree searching ImplementationBInary search tree deletion implementationTrees and Graphs Interview QuestionsExplanation - Symmetric Trees - Easy #101Code - Symmetric Trees - Easy #101Explanation - Maximum Depth of Binary Tree - Easy #104Code - Maximum Depth of Binary Tree - Easy #104Explanation - Path Sum - Easy #112Code - Path Sum - Easy #112Explanation- Lowest Common Ancestor of a Binary Tree - Medium #236Code- Lowest Common Ancestor of a Binary Tree - Medium #236Explanation - Kth Smallest Element in a BST - Medium #230Code - Kth Smallest Element in a BST - Medium #230Explanation - Serialize and Deserialize Binary Tree - hard #297Code - Serialize and Deserialize Binary Tree - hard #297Explanation - Binary Tree Maximum Path Sum - Hard #124Code - Binary Tree Maximum Path Sum - Hard #124Dynamic Programming (DP) Interview QuestionsWhat is Dynamic Programming ?Explanation - House Robber - Easy #198Code - House Robber - Easy #198Explanation - Best Time to Buy and Sell Stock - Easy #121Code - Best Time to Buy and Sell Stock - Easy #121Explanation - Climbing Stairs - Easy #70Code - Climbing Stairs - Easy #70Explanation - Coin Change - Medium #322Code - Coin Change - Medium #322Explanation - Unique Paths - Medium #62Code - Unique Paths - Medium #62Explanation - Longest Palindromic Substring - Medium #5Code - Longest Palindromic Substring - Medium #5Explanation - Trapping Rain Water - Hard #42Code - Trapping Rain Water - Hard #42
评论(0)