Coding Interview Preparation Learn to Solve Algorithmic Problems to Land Your Next Software Role

Module 1 Introduction to Problem Solving/005. Lesson 1.5 Logic Puzzle.mp4

Module 3 Dynamic Programming/005. Lesson 3.5 Solve Another DP Problem.mp4

Module 3 Dynamic Programming/003. Lesson 3.3 Longest Increasing Subsequence Using Bottom-Up Tabulation.mp4

Module 1 Introduction to Problem Solving/004. Lesson 1.4 Minimize Completion Time.mp4

Module 2 Recursion and Applying Stacks and Queues/002. Lesson 2.2 Determine if Rectangular Maze has a Solution Using a Stack.mp4

Module 3 Dynamic Programming/002. Lesson 3.2 Identifying Overlapping Subproblems.mp4

Module 1 Introduction to Problem Solving/001. Lesson 1.1 Data Type Capabilities and Input Data for Problems.mp4

Module 1 Introduction to Problem Solving/003. Lesson 1.3 Three Different Tasks.mp4

Module 3 Dynamic Programming/001. Lesson 3.1 Introduction to Dynamic Programming.mp4

Module 2 Recursion and Applying Stacks and Queues/006. Lesson 2.6 Eliminating Symmetry to Reduce Unique Boards Even Further.mp4

Module 2 Recursion and Applying Stacks and Queues/004. Lesson 2.4 Demonstrate Recursion for Depth-First Search Alternative.mp4

Module 3 Dynamic Programming/004. Lesson 3.4 Longest Increasing Subsequence Using Memoization with Recursion.mp4

Module 1 Introduction to Problem Solving/002. Lesson 1.2 Eliminate Redundant Data and Store Maximum Time for (worker, task).mp4

Module 2 Recursion and Applying Stacks and Queues/001. Lesson 2.1 How to Represent State for Different Problems.mp4

Module 2 Recursion and Applying Stacks and Queues/003. Lesson 2.3 Determine Shortest Path in a Rectangular Maze Using a Queue.mp4

001. Course Introduction.mp4

Module 3 Dynamic Programming/006. Lesson 3.6 Course Conclusion.mp4

Module 1 Introduction to Problem Solving/005. Lesson 1.5 Logic Puzzle.en.srt

Module 2 Recursion and Applying Stacks and Queues/005. Lesson 2.5 Use Recursion to Determine the Number of Different Tic-Tac-Toe Boards.en.srt

Module 3 Dynamic Programming/005. Lesson 3.5 Solve Another DP Problem.en.srt

Module 3 Dynamic Programming/003. Lesson 3.3 Longest Increasing Subsequence Using Bottom-Up Tabulation.en.srt

Module 1 Introduction to Problem Solving/001. Lesson 1.1 Data Type Capabilities and Input Data for Problems.en.srt

Module 3 Dynamic Programming/002. Lesson 3.2 Identifying Overlapping Subproblems.en.srt

Module 2 Recursion and Applying Stacks and Queues/002. Lesson 2.2 Determine if Rectangular Maze has a Solution Using a Stack.en.srt

Module 1 Introduction to Problem Solving/004. Lesson 1.4 Minimize Completion Time.en.srt

Module 3 Dynamic Programming/001. Lesson 3.1 Introduction to Dynamic Programming.en.srt

Module 2 Recursion and Applying Stacks and Queues/004. Lesson 2.4 Demonstrate Recursion for Depth-First Search Alternative.en.srt

Module 2 Recursion and Applying Stacks and Queues/006. Lesson 2.6 Eliminating Symmetry to Reduce Unique Boards Even Further.en.srt

Module 1 Introduction to Problem Solving/003. Lesson 1.3 Three Different Tasks.en.srt

Module 3 Dynamic Programming/004. Lesson 3.4 Longest Increasing Subsequence Using Memoization with Recursion.en.srt

Module 2 Recursion and Applying Stacks and Queues/001. Lesson 2.1 How to Represent State for Different Problems.en.srt

Module 2 Recursion and Applying Stacks and Queues/003. Lesson 2.3 Determine Shortest Path in a Rectangular Maze Using a Queue.en.srt

Module 1 Introduction to Problem Solving/002. Lesson 1.2 Eliminate Redundant Data and Store Maximum Time for (worker, task).en.srt

001. Course Introduction.en.srt

Module 3 Dynamic Programming/006. Lesson 3.6 Course Conclusion.en.srt

Module 2 Recursion and Applying Stacks and Queues/005. Lesson 2.5 Use Recursion to Determine the Number of Different Tic-Tac-Toe Boards.mp4