吉田 慎太郎

Arai60との重複を考慮したBlind75

目次

• Arai60の問題
• Blind75でのみ載っている問題
• Arai60とBlind75で共通の問題

Arai60の問題 (60問)

Blind75でのみ載っている問題 (50問)

Array (5)

• Contains Duplicate
• Product of Array Except Self
• Maximum Product Subarray
• 3Sum
• Container With Most Water

Binary Search (5)

• Sum of Two Integers
• Number of 1 Bits
• Counting Bits
• Missing Number
• Reverse Bits

Dynamic Programming (5)

• Climbing Stairs
• Longest Common Subsequence
• Combination Sum IV
• Decode Ways
• Jump Game

Graph (6)

• Clone Graph
• Course Schedule
• Pacific Atlantic Water Flow
• Longest Consecutive Sequence
• Alien Dictionary (Premium)
• Graph Valid Tree (Premium)

Interval (3)

• Insert Interval
• Merge Intervals
• Non-overlapping Intervals

Linked List (4)

• Merge Two Sorted Lists
• Merge K Sorted Lists
• Remove Nth Node From End Of List
• Reorder List

Matrix (4)

• Set Matrix Zeroes
• Spiral Matrix
• Rotate Image
• Word Search

String (7)

• Longest Repeating Character Replacement
• Minimum Window Substring
• Valid Anagram
• Valid Palindrome
• Longest Palindromic Substring
• Palindromic Substrings
• Encode and Decode Strings (Premium)

Tree(10)

• Same Tree
• Invert/Flip Binary Tree
• Binary Tree Maximum Path Sum
• Serialize and Deserialize Binary Tree
• Subtree of Another Tree
• Kth Smallest Element in a BST
• Lowest Common Ancestor of BST
• Implement Trie (Prefix Tree)
• Add and Search Word
• Word Search II

Heap (1)

• Find Median from Data Stream

Arai60とBlind75で共通の問題 (25問)

Array (5)

• Two Sum
• Best Time to Buy and Sell Stock
• Maximum Subarray
• Find Minimum in Rotated Sorted Array
• Search in Rotated Sorted Array

Dynamic Programming (6)

• Coin Change
• Longest Increasing Subsequence
• Word Break
• House Robber II
• House Robber II
• Unique Paths

Graph (2)

• Number of Islands
• Number of Connected Components in an Undirected Graph (Premium)

Interval (2)

• Meeting Rooms (Premium)
• Meeting Rooms II (Premium)

Linked List (2)

• Reverse Linked List
• Linked List Cycle

String (3)

• Longest Substring Without Repeating Characters
• Group Anagrams
• Valid Parentheses

Tree (4)

• Maximum Depth of Binary Tree
• Binary Tree Level Order Traversal
• Construct Binary Tree from Preorder and Inorder Traversal
• Validate Binary Search Tree

Heap (1)

• Top K Frequent Elements