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.
Take your coding interview preparation to the next level with an in-depth focus on recursion, stacks, and queues! This course builds upon fundamental problem-solving techniques, helping you master recursive algorithms, optimize memory usage, and efficiently implement stack and queue-based solutions. You'll explore real-world coding challenges, learn how to approach them systematically, and gain the confidence to tackle technical interviews at top companies. Whether you're refining your skills or preparing for a competitive coding environment, this course equips you with essential techniques to solve complex problems with ease.
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
£14.00
£21.00
Course includes:
-
Level
-
Intermediate
-
Duration
0h 43m
-
Lessons
5
-
Certifications
Yes
-
Language
-
English