Coding Interview Preparation: Recursion, Stacks & Queues Part 2
Course Description
Continue your coding interview prep with this deep dive into recursion, stacks, and queues. You’ll learn to solve maze problems, represent states, and apply recursion to optimize solutions. Perfect for those aiming to tackle more advanced algorithms during interviews.
Course Curriculum
-
001. Lesson 2.1 How to Represent State for Different Problems
-
002. Lesson 2.2 Determine if Rectangular Maze has a Solution Using a Stack
-
003. Lesson 2.3 Determine Shortest Path in a Rectangular Maze Using a Queue
-
004. Lesson 2.4 Demonstrate Recursion for Depth-First Search Alternative
-
006. Lesson 2.6 Eliminating Symmetry to Reduce Unique Boards Even Further
This Course Fee:
£190.00
£190.00
£250.00
Course includes:
-
Level
-
Intermediate
-
Duration
1h
-
Lessons
0
-
Certifications
Yes
-
Language
-
English