Grokking the Engineering Manager Coding Interview

Name: Grokking the Engineering Manager Coding Interview
Price: 98 USD
Rating: 4.2 (2041 reviews)

Your ultimate guide to successfully acing Engineering Manager coding interviews.

Level:

Intermediate

Study Time:

10h

Lessons:

119

Playgrounds :

127

4.2

(2,041 ratings)

7,117 learners

Course Overview

Are you preparing for a coding interview to land an engineering manager role at a top tech company? If so, **Grokking the Engineering Manager Coding Interview** is crafted to give you the edge you need. With a focus on mastering essential data structures and proven coding patterns, this course will equip you to solve problems quickly and effectively. You'll ...

Course Content

• 11 Chapters • 119 Lessons

Introduction

1 lesson

Course Overview

Array

12 lessons

Introduction to Arrays

Arrays in Different Programming Languages

Running Sum of 1d Array (easy)

Solution: Running Sum of 1d Array

Find the Highest Altitude (easy)

Solution: Find the Highest Altitude

Array Transformation (easy)

Solution: Array Transformation

Minimum Increment to Make Array Unique (medium)

Solution: Minimum Increment to Make Array Unique

Maximum Gap (medium)

Solution: Maximum Gap

Hash Table (aka Hashmap or Dictionary)

13 lessons

Introduction to Hashing

Introduction to Hash Tables

Issues with Hash Tables

First Non-repeating Character (easy)

Solution: First Non-repeating Character (easy)

Largest Unique Number (easy)

Solution: Largest Unique Number (easy)

Subarray Sum Equals K (medium)

Solution: Subarray Sum Equals K

Least Number of Unique Integers after K Removals (medium)

Solution: Least Number of Unique Integers after K Removals

Minimum Number of Steps to Make Two Strings Anagram (medium)

Solution: Minimum Number of Steps to Make Two Strings Anagram

Stack

14 lessons

Introduction to Stack

Operations on Stack

Implementing Stack Data Structure

Applications of Stack

Balanced Parentheses (easy)

Solution: Balanced Parentheses

Reverse a String (easy)

Solution: Reverse a String

Decimal to Binary Conversion (medium)

Solution: Decimal to Binary Conversion

Daily Temperatures (medium)

Solution: Daily Temperatures

Evaluate Reverse Polish Notation (medium)

Solution: Evaluate Reverse Polish Notation

Queue

14 lessons

Introduction to Queues

Working with Simple Queues

Diving Deeper – Circular Queues and Deques

Applications and Advanced Concepts

Reverse a Queue (easy)

Solution: Reverse a Queue

Implement Stack using Queues (easy)

Solution: Implement Stack using Queues

Zigzag Iterator (medium)

Solution: Zigzag Iterator

Continuous Subarrays (medium)

Solution: Continuous Subarrays

Sum of Subarray Minimums (medium)

Solution: Sum of Subarray Minimums

HashSet

11 lessons

Introduction to HashSets

Counting Elements (easy)

Solution: Counting Elements

Jewels and Stones (easy)

Solution: Jewels and Stones

Unique Number of Occurrences (easy)

Solution: Unique Number of Occurrences (easy)

Determine if Two Strings Are Close (medium)

Solution: Determine if Two Strings Are Close

Longest Consecutive Sequence (medium)

Solution: Longest Consecutive Sequence

Two Pointers Pattern

11 lessons

Introduction to Two Pointers Pattern

Squaring a Sorted Array (easy)

Solution: Squaring a Sorted Array

Triplet Sum to Zero (medium)

Solution: Triplet Sum to Zero

Quadruple Sum to Target (medium)

Solution: Quadruple Sum to Target

Dutch National Flag Problem (medium)

Solution: Dutch National Flag Problem

Triplets with Smaller Sum (medium)

Solution: Triplets with Smaller Sum

Sliding Window Pattern

9 lessons

Introduction to Sliding Window Pattern

Smallest Subarray With a Greater Sum (easy)

Solution: Smallest Subarray With a Greater Sum

Longest Substring with K Distinct Characters (medium)

Solution: Longest Substring with K Distinct Characters

Longest Substring with Same Letters after Replacement (hard)

Solution: Longest Substring with Same Letters after Replacement

Smallest Window containing Substring (hard)

Solution: Smallest Window containing Substring

Tree BFS/DFS Pattern

12 lessons

Introduction to Tree Breadth First Search Pattern

Introduction to Tree Depth First Search Pattern

All Paths for a Sum (medium)

Solution: All Paths for a Sum

Path With Given Sequence (medium)

Solution: Path With Given Sequence

Tree Diameter (medium)

Solution: Tree Diameter

All Nodes Distance K in Binary Tree (medium)

Solution: All Nodes Distance K in Binary Tree

Even Odd Tree (medium)

Solution: Even Odd Tree

10.

Island (Matrix Traversal) Pattern

11 lessons

Introduction to Island Pattern

Number of Islands (easy)

Solution: Number of Islands

Biggest Island (easy)

Solution: Biggest Island

Number of Closed Islands (easy)

Solution: Number of Closed Islands

Walls and Gates (medium)

Solution: Walls and Gates

Shortest Path in a Grid with Obstacles Elimination (hard)

Solution: Shortest Path in a Grid with Obstacles Elimination

11.

Greedy Algorithm Pattern

11 lessons

Introduction to Greedy Algorithm

Valid Palindrome II (easy)

Solution: Valid Palindrome II

Maximum Length of Pair Chain (medium)

Solution: Maximum Length of Pair Chain

Remove Duplicate Letters (medium)

Solution: Remove Duplicate Letters

Largest Palindromic Number (medium)

Solution: Largest Palindromic Number

Meeting Rooms II (medium)

Solution: Meeting Rooms II

What people say about our courses

Related Courses

New

Grokking the Engineering Manager Coding Interview

Prepare for engineering manager coding interviews with targeted practice, problem-solving strategies, and guidance to showcase leadership and technical expertise.

4.2