Grokking 75: Top Coding Interview Questions

Name: Grokking 75: Top Coding Interview Questions
Brand: Design Guru
SKU: 42996
Price: 3158.00 INR
Availability: InStock
Rating: 5.00 (1 reviews)

- 62%

Original price was: ₹8,227.00.Current price is: ₹3,158.00.

Add to wishlistAdded to wishlistRemoved from wishlist 0

Add to compare+

Start Course

level	Beginner
Duration	25h
Lessons	176
PlayGround	188

Design Guru

Category: Interview Prep

Prepare for success with Grokking 75: Top Coding Interview Questions. Master the most frequently asked questions to ace your coding interviews with confidence!

★★★★★

(1 customer review)

Product is rated as #11 in category Interview Prep

Description
Reviews (1)

Course Overview

Unlock the secrets of acing coding interviews with “Grokking 75 – Top Coding Interview Questions,” the definitive course made for those determined to excel in interviews at top tech giants like the FAANG companies. This expertly designed course zeroes in on the most important and frequently asked questions from the past year, ensuring you engage with material that’s both up-to-date and highly relevant. Whether you’re pressed for time or just looking to refine your coding skills, this course promises to equip you with the knowledge and skills necessary to navigate the complexities of technical interviews confidently.
The course is meticulously structured to cater to a wide range of learners—from aspiring software engineers and seasoned professionals seeking a refresher, to students eager to bolster their problem-solving capabilities. With features like pattern-based learning, multilingual support, and real interview simulations, “Grokking 75” transforms your preparation into an immersive learning experience. Prepare for success with Grokking 75: Top Coding Interview Questions. Master the most frequently asked questions to ace your coding interviews with confidence! Don’t just prepare—master the art of coding interviews with a course that’s as ambitious as you are.

Introduction

Course Overview

Array/String

Introduction to Arrays
Arrays in Different Programming Languages
Kids With the Greatest Number of Candies (easy)
Solution: Kids With the Greatest Number of Candies
Roman to Integer (easy)
Solution: Roman to Integer
Best Time to Buy and Sell (easy)
Solution: Best Time to Buy and Sell Stock
Zigzag Conversion (medium)
Solution: Zigzag Conversion
Jump Game (medium)
Solution: Jump Game
Jump Game II (medium)
Solution: Jump Game II
H-Index (medium)
Solution: H-Index

Two Pointers

Introduction to Two Pointers Pattern
Pair with Target Sum (easy)
Solution: Pair with Target Sum
Dutch National Flag Problem (medium)
Solution: Dutch National Flag Problem
Comparing Strings containing Backspaces (medium)
Solution: Comparing Strings containing Backspaces
Minimum Window Sort (medium)
Solution: Minimum Window Sort

Sliding Window

Introduction to Sliding Window Pattern
Maximum Average Subarray I (easy)
Solution: Maximum Average Subarray I
Maximum Number of Vowels in a Substring of Given Length (medium)
Solution: Maximum Number of Vowels in a Substring of Given Length
Max Consecutive Ones III (medium)
Solution: Max Consecutive Ones III
Longest Subarray of 1’s After Deleting One Element (medium)
Solution: Longest Subarray of 1’s After Deleting One Element
Minimum Size Subarray Sum (medium)
Solution: Minimum Size Subarray Sum
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)

Matrix

Introduction to Matrix
Valid Sudoku (medium)
Solution: Valid Sudoku
Spiral Matrix (medium)
Solution: Spiral Matrix
Rotate Image (medium)
Solution: Rotate Image
Set Matrix Zeroes (medium)
Solution: Set Matrix Zeroes

Hash Map/Set

Introduction to HashSets
Contains Duplicate II (easy)
Solution: Contains Duplicate II
Word Pattern (easy)
Solution: Word Pattern
Determine if Two Strings Are Close (medium)
Solution: Determine if Two Strings Are Close
Group Anagrams (medium)
Solution: Group Anagrams
Longest Consecutive Sequence (medium)
Solution: Longest Consecutive Sequence

Linked List

Introduction to LinkedList
Add Two Numbers (medium)
Solution: Add Two Numbers
Reverse Linked List II (medium)
Solution: Reverse Linked List II
Odd Even Linked List (medium)
Solution: Odd Even Linked List
Reverse Nodes in k-Group (hard)
Solution: Reverse Nodes in k-Group

Stack & Monotonic Stack

Introduction to Stack
Operations on Stack
Implementing Stack Data Structure
Applications of Stack
Introduction to Monotonic Stack
Valid Parentheses (easy)
Solution: Valid Parentheses
Evaluate Reverse Polish Notation (medium)
Solution: Evaluate Reverse Polish Notation
Simplify Path (medium)
Solution: Simplify Path
Daily Temperatures (medium)
Solution: Daily Temperatures

Tree Depth First Search (DFS)

Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Path Sum III (medium)
Solution: Path Sum III
Count Good Nodes in Binary Tree (medium)
Solution: Count Good Nodes in Binary Tree
Lowest Common Ancestor of a Binary Search Tree (medium)
Solution: Lowest Common Ancestor of a Binary Search Tree
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree

Tree Breadth First Search (BFS)

All Nodes Distance K in Binary Tree (medium)
Solution: All Nodes Distance K in Binary Tree
Even Odd Tree (medium)
Solution: Even Odd Tree
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row

Binary Tree

Introduction to Tree
Binary Search Tree (BST)
Cousins in Binary Tree (easy)
Solution: Cousins in Binary Tree
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
Amount of Time for Binary Tree to Be Infected (medium)
Solution: Amount of Time for Binary Tree to Be Infected
Maximum Difference Between Node and Ancestor (medium)
Solution: Maximum Difference Between Node and Ancestor
Kth Smallest Element in a BST (medium)
Solution: Kth Smallest Element in a BST
Path with Maximum Sum (hard)
Solution: Path with Maximum Sum

Graph

Introduction to Graph
Graph Representations
Graph as an Abstract Data Type (ADT)
Find the Town Judge (easy)
Solution: Find the Town Judge
Course Schedule (medium)
Solution: Course Schedule
Clone Graph (medium)
Solution: Clone Graph

Graph BFS/DFS

Graph Traversal – Depth First Search(DFS)
Graph Traversal – Breadth First Search (BFS)
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
Rotting Oranges (medium)
Solution: Rotting Oranges
Word Ladder (hard)
Solution: Word Ladder

Heap/Priority Queue

Introduction to Heap
Smallest Range Covering Elements from K Lists (hard)
Solution: Smallest Range Covering Elements from K Lists
K-th Smallest Prime Fraction (medium)
Solution: K-th Smallest Prime Fraction
Sort Characters By Frequency (medium)
Solution: Sort Characters By Frequency
Rearrange String (hard)
Solution: Rearrange String
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays

Backtracking

Introduction to Backtracking Pattern
Permutations II (medium)
Solution: Permutations II
Letter Combinations of a Phone Number (medium)
Solution: Letter Combinations of a Phone Number
Balanced Parentheses (hard)
Solution: Balanced Parentheses
Palindromic Partitioning (hard)
Solution: Palindromic Partitioning

Dynamic Programming (DP)

What is Dynamic Programming?
N-th Tribonacci Number (easy)
Solution: N-th Tribonacci Number
Partition Array for Maximum Sum (medium)
Solution: Partition Array for Maximum Sum
Number of Dice Rolls With Target Sum (medium)
Solution: Number of Dice Rolls With Target Sum

Intervals

Merge Intervals (medium)
Solution: Merge Intervals
Insert Interval (medium)
Solution: Insert Interval

Divide & Conquore

Majority Element (easy)
Solution: Majority Element
Longest Substring with At Least K Repeating Characters (medium)
Solution: Longest Substring with At Least K Repeating Characters – Copy

Trie

Introduction to Trie
Implement Trie (Prefix Tree) (medium)
Solution: Implement Trie (Prefix Tree)
Design Add and Search Words Data Structure (medium)
Solution: Design Add and Search Words Data Structure
Search Suggestions System (medium)
Solution: Search Suggestions System

1 review for Grokking 75: Top Coding Interview Questions

5.0 out of 5

★★★★★

Write a review

Show all Most Helpful Highest Rating Lowest Rating

★★★★★

Gungun – November 29, 2024

The emphasis on patterns and frameworks made problem-solving much easier.

Helpful(0) Unhelpful(0)You have already voted this