Grokking Data Structures & Algorithms for Coding Interviews

Name: Grokking Data Structures & Algorithms for Coding Interviews
Price: 78 USD
Availability: InStock
Rating: 4.214285714285714 (9496 reviews)

Unlock Coding Interview Success: Dive Deep into Data Structures and Algorithms!

Level:

Beginner

Study Time:

50h

Lessons:

205

Playgrounds:

250

Updated

Last month

4.2

(9,496 ratings)

28,277 learners

Created byArslan Ahmad

Ex FAANG Manager, Expert Behind Grokking Data Structures & Algorithms for Coding Interviews

Course Overview

In this comprehensive course, we delve deep into the world of data structures & algorithms, covering both the commonly used and the more advanced topics. Participants will learn the principles, usage, and implementation of various data structures, along with their time and space complexities. The course will feature multiple coding problems for each data structure and is tailored for coding interviews. By the end of this course, learners will be adept at selecting and applying the most suitable data structure for any coding problem, ensuring optimized code performance. Prepare to elevate your coding skills and ace those coding interviews with confidence!

Grokking Data Structures & Algorithms for Coding Interviews Image

Best value

Lifetime access to this course

One-time payment. Yours forever.

$78

Discussions

Certificate

Free updates

Want all 37+ courses?

Best value

Lifetime access to this course

One-time payment. Yours forever.

$78

Discussions

Certificate

Free updates

Want all 37+ courses?

Course Content

• Chapters • 205 Lessons

Introduction to Data Structures

4 lessons

Who Should Take This Course?

Understanding Data Structures

Types of Data Structures

An Overview of Big-O

Array

10 lessons

Introduction to Arrays

Arrays in Different Programming Languages

Problem 1: Running Sum of 1d Array (easy)

Problem 2: Contains Duplicate (easy)

Problem 3: Left and Right Sum Differences (easy)

Problem 4: Find the Highest Altitude (easy)

Matrix

7 lessons

Introduction to Matrix

Problem 1: Richest Customer Wealth (easy)

Problem 2: Matrix Diagonal Sum (easy)

Problem 3: Row With Maximum Ones(easy)

Stack

22 lessons

Introduction to Stack

Implementing Stack Data Structure

Using Built-in Stack in Different Programming Languages

Applications of Stack

Problem 1: Balanced Parentheses (easy)

Problem 2: Reverse a String (easy)

Problem 3: Decimal to Binary Conversion (medium)

Problem 4: Next Greater Element (easy)

Problem 5: Sorting a Stack (easy)

Problem 6: Simplify Path (medium)

Problem 7: Remove All Adjacent Duplicates In String (medium)

Problem 8: Removing Stars From a String (medium)

Problem 9: Make The String Great (easy)

Queue

18 lessons

Introduction to Queues

Working with Simple Queues

Queue Implementation in Different Languages

Types of Queue

Diving Deeper – Circular Queues and Deques

Applications and Advanced Concepts

Reverse a Queue (easy)

Implement Stack using Queues (easy)

Generate Binary Numbers from 1 to N

Zigzag Iterator (medium)

Max of All Subarrays of Size 'k' (medium)

Palindrome Check using Queue (easy)

LinkedList

14 lessons

Introduction to LinkedList

Types of LinkedList

Operations on Singly Linked List

Operations on Doubly Linked List

Problem 1: Reverse Linked List (easy)

Problem 2: Remove Duplicates from Sorted List (easy)

Problem 3: Merge Two Sorted Lists (easy)

Problem 4: Find if Doubly Linked List is a Palindrome (easy)

Problem 5: Swap Nodes in Pairs (medium)

Tree & Binary Search Tree

18 lessons

Introduction to Tree

Types of Tree

BST Traversal Techniques

BST Operations

Maximum Depth (or Height) of Binary Tree (easy)

Balanced Binary Tree (easy)

Minimum Difference Between BST Nodes (easy)

Range Sum of BST (easy)

Kth Smallest Element in a BST (medium)

Closest Binary Search Tree Value (medium)

Merge Two Binary Trees (medium)

Hash Table (aka Hashmap or Dictionary)

13 lessons

Introduction to Hash Tables

Hashing, Collisions, Overflow, and Resizing in Hashtables

Using Hashtable in Different Programming Languages

Problem 1: First Non-repeating Character (easy)

Problem 2: Largest Unique Number (easy)

Problem 3: Maximum Number of Balloons (easy)

Problem 4: Longest Palindrome(easy)

Problem 5: Ransom Note (easy)

HashSet

10 lessons

Introduction to HashSets

Using HashSets in Different Programming Languages

Problem 1: Counting Elements (easy)

Problem 2: Jewels and Stones (easy)

Problem 3: Unique Number of Occurrences (easy)

Problem 4: Longest Substring Without Repeating Characters (medium)

10.

Heap

10 lessons

Introduction to Heap

Heap Operations

Take Gifts From the Richest Pile(easy)

Sort Characters By Frequency (easy)

Minimum Cost to Connect Sticks(medium)

Find the Median of a Number Stream (medium)

11.

Graph

15 lessons

Introduction to Graph

Types of Graph

Graph Representations

Graph Traversal - Depth First Search(DFS)

Graph Traversal - Breadth First Search (BFS)

Find if Path Exists in Graph(easy)

Number of Provinces (medium)

Find Eventual Safe States (medium)

Minimum Number of Vertices to Reach All Nodes(medium)

Bus Routes (hard)

12.

Trie (aka Prefix Tree)

11 lessons

Introduction to Trie

Implement Trie (Prefix Tree) (medium)

Index Pairs of a String (easy)

Extra Characters in a String (medium)

Search Suggestions System (medium)

Design Add and Search Words Data Structure (medium)

13.

Sorting

16 lessons

Introduction to Sorting Algorithms

Advanced Sorting Techniques

Apple Redistribution into Boxes (easy)

Sort Array by Increasing Frequency (easy)

Sort Vowels in a String (medium)

Reduction Operations to Make the Array Elements Equal (medium)

Divide Array Into Arrays With Max Difference (medium)

Top 'K' Frequent Numbers (medium)

Meeting Rooms II (medium)

14.

Searching

13 lessons

Introduction to Searching Algorithms

Maximum Count of Positive Integer and Negative Integer (easy)

Minimum Common Value (easy)

Frequency of the Most Frequent Element (medium)

Minimize the Maximum of Two Arrays (medium)

Search a 2D Matrix II (medium)

Sqrt (medium)

15.

Greedy Algorithm

13 lessons

Introduction to Greedy Algorithm

Valid Palindrome II (easy)

Maximum Length of Pair Chain (medium)

Minimum Add to Make Parentheses Valid (medium)

Remove Duplicate Letters (medium)

Largest Palindromic Number (Medium)

Removing Minimum and Maximum From Array (medium)

16.

Divide and Conquer Algorithm

11 lessons

Introduction to Divide and Conquer Algorithm

Longest Nice Substring (easy)

Majority Element (easy)

Sort List (medium)

Maximum Binary Tree (medium)

Beautiful Array (medium)

What people say about our courses

Roger Cruz

Software Engineer

The world gets better inch by inch when you help someone else. If you haven't tried Grokking The Coding Interview, check it out, it's a great resource!

Simon Barker

Software Engineer

This is what I love about http://designgurus.io’s Grokking the coding interview course. They teach patterns rather than solutions.

Steven Zhang

Software Engineer

Just wanted to say thanks for your Grokking the system design interview resource (https://lnkd.in/g4Wii9r7) - it helped me immensely when I was interviewing from Tableau (very little system design exp) and helped me land 18 FAANG+ jobs!

Eric

Software Engineer

I've completed my first pass of "grokking the System Design Interview" and I can say this was an excellent use of money and time. I've grown as a developer and now know the secrets of how to build these really giant internet systems.

Ashley Pean

Software Engineer

Check out Grokking the Coding Interview. Instead of trying out random Algos, they break down the patterns you need to solve them. Helps immensely with retention!

Arijeet

Software Engineer

Just completed the “Grokking the system design interview”. It's amazing and super informative. Have come across very few courses that are as good as this!

About the Author

Arslan Ahmad

Design Gurus Founder

Ex-FAANG Manager

Industry Expertise & Leadership

Arslan Ahmad is the lead author of Grokking Data Structures & Algorithms for Coding Interviews. As the founder of Design Gurus and a former FAANG hiring manager, he has worked at industry giants like Facebook (now Meta) and Microsoft.

He has conducted hundreds of system design interviews, giving him unique insight into what top tech companies look for in candidates.

The course also incorporates expertise from senior engineers at Google, Meta, Amazon, Microsoft, and Uber, ensuring you learn system design best practices from professionals who have built and scaled real-world systems.

500+

Interviews Conducted

10k+

Students Taught