>

grind_169.md

Array

String

[x] Valid Palindrome
[x] Valid Anagram
[ ] Longest Substring Without Repeating Characters
[ ] Longest Palindrome
[ ] Minimum Window Substring
[ ] String to Integer (atoi)
[ ] Longest Palindromic Substring
[ ] Find All Anagrams in a String
[x] Group Anagrams
[ ] Longest Repeating Character Replacement
[ ] Longest Common Prefix
[ ] Largest Number
[ ] Encode and Decode Strings
[ ] Palindrome Pairs

Matrix

Binary Search

[ ] Binary Search
[ ] First Bad Version
[ ] Search in Rotated Sorted Array
[ ] Time Based Key-Value Store
[ ] Maximum Profit in Job Scheduling
[ ] Median of Two Sorted Arrays
[ ] Search a 2D Matrix
[ ] Find Minimum in Rotated Sorted Array

Graph

[ ] Flood Fill
[ ] 01 Matrix
[ ] Clone Graph
[ ] Course Schedule
[ ] Number of Islands
[ ] Rotting Oranges
[ ] Accounts Merge
[ ] Word Ladder
[ ] Word Search
[ ] Minimum Height Trees
[ ] Pacific Atlantic Water Flow
[ ] Shortest Path to Get Food
[ ] Graph Valid Tree
[ ] Course Schedule II
[ ] Number of Connected Components in an Undirected Graph
[ ] Minimum Knight Moves
[ ] Longest Increasing Path in a Matrix
[ ] Word Search II
[ ] Alien Dictionary
[ ] Bus Routes
[ ] Cheapest Flights Within K Stops

Binary Search Tree

Binary Tree

[ ] Invert Binary Tree
[ ] Balanced Binary Tree
[ ] Binary Tree Level Order Traversal
[ ] Lowest Common Ancestor of a Binary Tree
[ ] Serialize and Deserialize Binary Tree
[ ] Diameter of Binary Tree
[ ] Binary Tree Right Side View
[ ] Maximum Depth of Binary Tree
[ ] Construct Binary Tree from Preorder and Inorder Traversal
[ ] Binary Tree Maximum Path Sum
[ ] Path Sum II
[ ] Maximum Width of Binary Tree
[ ] Same Tree
[ ] Binary Tree Zigzag Level Order Traversal
[ ] Path Sum III
[ ] Symmetric Tree
[ ] All Nodes Distance K in Binary Tree
[ ] Subtree of Another Tree

Hash Table

Recursion

[ ] Permutations
[ ] Subsets
[ ] Letter Combinations of a Phone Number
[ ] Next Permutation
[ ] Generate Parentheses
[ ] N-Queens

Linked List

Stack

Queue

[ ] Design Hit Counter

Heap

[ ] K Closest Points to Origin
[ ] Find Median from Data Stream
[x] Merge k Sorted Lists
[ ] Task Scheduler
[ ] Top K Frequent Words
[ ] Find K Closest Elements
[ ] Kth Largest Element in an Array
[ ] Smallest Range Covering Elements from K Lists

Trie

[ ] Implement Trie (Prefix Tree)
[ ] Word Break
[ ] Design Add and Search Words Data Structure
[ ] Design In-Memory File System

Dynamic Programming

Binary

Math

All Grind 169 Questions

grind.rip

From Grind Hell, with Love

By the same author of the "Blind 75", the "Grind 169" is an extension of the original 75 most essential coding interview questions. The Grind 169 aims at providing a broader and more comprehensive set of coding interview questions.