Coding Interview Patterns - Course Outline

Pre-requisite: If you directly landed on this page, I recommend you to quickly read one of my posts that explains why I am writing this course, what would be different about it, how it will help you and what precisely coding interview patterns mean.

You can find the course outline on Coding Interview Patterns in this post. This will help you systematically navigate different topics, covering specific algorithms, data structures, and techniques foundational for your coding interview prep.

Linked List

• Basics of Linked List
• Reversing a Linked List
   - Reverse a sub-list
   - Reverse k-groups of Linked List (TBD)
• Slow & Fast Pointer Approach
   - Find the middle of the Linked List
   - Detect a cycle in a Linked List
• Applications of the Linked List patterns (TBD)
   - Find if Linked List is Palindromic
   - Addition of two Linked Lists

Graphs

• Graph Patterns - Basics

BFS & DFS

• Breadth-First Search Traversal

Heap (TBD)

• Coming Soon

Sliding Window (TBD)

• Coming Soon

A lot of effort and time goes into creating the course content and a lot more if it needs to be on point without the fluff. If you have any immediate feedback or questions about the content, please get in touch with me at this email.
More such posts on coding interview patterns covering different topics on algorithms and data structures are being developed.

Stay up-to-date by bookmarking this page and revisiting this page or better yet, sign up for the newsletter to get notified of new posts. Cheers :)