NeetCode 150 C++

基本的にはRustで一旦解いたあとでC++でも解くというスタンス(基本的に初見ではない)

• now(2024 0422): READMEの更新中(リンクを追加した,まだ途中)

Array & Hash

• Contains Duplicate

  • 理解: o

• Valid Anagram

  • 理解: o

• Two Sum

  • 理解: o

• Group Anagrams

  • 理解: o

• Top K Frequent Elements

  • 理解: o

• Product of Array Except Self

  • 理解: ○

• Valid Sudoku

  • 理解: o

• Encode and Decode Strings

  • 理解: o

• Longest Consective Sequence

  • 理解: o

Two Pointers

• Valid Palindrome

  • 理解: o

• Two Sum II

  • 理解: o

• 3sum

  • 理解: o

• Continer with Most Water

  • 初見: x

• Trapping Rain Water

  • 理解: o

Sliding Window

• Best Time to Buy And Sell Stock

  • 理解: o

• Longest Substring Without Repeating Characters

  • 理解: o

• Longest Repeating Character Replacement

  • 理解: o

• Permutation In String

  • 理解: o

• Minimum Window Substring

  • 理解: x

• Sliding Window Maximum

  • 理解: o

Stack

• Valid Parentheses

  • 理解: o

• Min Stack

  • 理解: o

• Evaluate Reverse Polish Notation

  • 理解: o

• Generate Parentheses

  • 理解: o

• Daily Temperatures

  • 理解: o

• Car Fleet

  • 理解: o

• Largest Rectangle In Histogram

  • 理解: x

Binary Search

• Binry Search

  • 理解: o

• Seach a 2D Matrix

  • 理解: o

• Koko Eating Bananas

  • 理解: x

• Find Minimum In Rotated Sorted Array

  • 理解: o

• Search In Rotated Sorted Array

  • 理解: o

• Time Based Key Value Store

  • 理解: o

• Median of Two Sorted Arrays

  • 理解: x

Linked List

• Reverse Linked List

  • 理解: o

• Merge Two Sorted Lists

  • 理解: o

• Reorder List

  • 理解: o

• Remove Nth Node From End of List

  • 理解: o

• Copy List With Random Pointer

  • 理解:

• Add Two Numbers

  • 理解:

• Linked List Cycle

  • 理解: o

• Merge K Sorted Lists

  • 理解: x

Trees

• Invert Binary Tree

  • 初見: x
  • 理解: o

• Maximum Depth of Binary Tree

  • 初見: x
  • 理解: o

• Diameter of Binary Tree

  • 初見: x
  • 理解: o

• Balanced Binary Tree

  • 初見: x
  • 理解: x

• Same Tree

  • 初見: x
  • 理解: o

• Subtree of Another Tree

  • 初見: x
  • 理解: x

• Lowest Common Ancestor of Binary Search Tree

  • 初見: x
  • 理解: o

• Binary Tree Level Order Traversal

  • 初見: x
  • 理解: o

• Binary Tree Right Side View

  • 初見: x
  • 理解: x

• Count Good Nodes In Binary Tree

  • 初見: x
  • 理解: o

• Valid Binary Search Tree

  • 初見: x
  • 理解: x

• Kth Smallest Element In a Bst

  • 初見: x
  • 理解: x

• Construct Binary Tree From Preorder And Inorder Traversal

  • 初見: x
  • 理解: x

• Binary Tree Maximum Path Sum

  • 初見: x
  • 理解: o

• Serialize Ans Deserialize Binary Tree

  • 初見: x
  • 理解: x

Tries

• Implement Trie Prefix Tree

  • 初見: x
  • 理解: o

• Design Add And Search Words Data Structure

  • 初見: x
  • 理解: o

• Word Search II

  • 初見: x
  • 理解: x

Heap / Priority Queue

• Kth Largest Element In a Stream

  • 理解: o

• Last Stone Weight

  • 理解: o

• K Closest Points to Origin

  • 理解: o

• Kth Largest Element In An Array

  • 理解: o

• Task Scheduler

  • 理解: x

• Design Twitter

  • 理解: o

• Find Median From Data Stream

  • 理解: x

Backtracking

• Subsets

  • 理解: o

• Combination Sum

  • 理解: o

• Permutations

  • 理解: x

• Subsets II

  • 理解: o

• Combination Sum II

  • 理解: x

• Word Search

  • 理解: o

• Palindrome Partitioning

  • 理解: o

• Letter Combinations of a Phone Number

  • 理解: o

• N Queens

  • 理解: x

Graphs

• Number of Islands

  • 理解: o

• Max Area of Island

  • 理解: o

• Clone Graphs

  • 理解: o

• Walls And Gates

  • 初見: x
  • 理解: o

• Rotting Oranges

  • 理解: o

• Pacific Atlantic Water Flow

  • 理解: o

• Surrounded Regions

  • 理解: o

• Course Schedule

  • 理解: x

• Course Schedule II

  • 理解: x

• Graph Valid Tree

  • 初見: o
  • 理解: o

• Number of Connected Components In An Undirected Graph

  • 初見: o
  • 理解: o

• Redundant Connection

  • 理解: o

• Word Ladder

  • 理解: x

Advanced Graphs

• Reconstruct Itinerary

  • 理解: x

• Min Cost to Connect All Points

  • 初見: o
  • 理解: o

• Network Dleay Time

  • 初見: o
  • 理解: o

• Swim in Rising Water

  • 初見: x
  • 理解: x

• Alien Dictionary

  • 初見: x
  • 理解: x

• Cheapest Flight Within K Stops

  • 理解: x

1-D Dynamic Programming

• Climbing Stairs

  • 理解: o

• Min Cost Climbing Stairs

  • 理解: o

• House Robber

  • 理解: o

• House Robber II

  • 理解: o

• Longest Palindromic Substring

  • 理解: o

• Palindromic Substring

  • 初見: o

• Decode Ways

  • 初見: o

• Coin Change

  • 初見: o

• Max Product Subarray

  • 理解: o

• Partition Equal Subset Sum

  • 理解: o

2-D Dynamic Programming

• Unique Paths

  • 理解: x

• Longest Common Subsequence

  • 理解: o

• Best Time to Buy And Sell Stock With Cooldown

  • 理解: x

• Coin Change II

  • 理解: x

Greedy

• Maximum Subarray

  • 理解: x

• Jump Game

  • 理解: o

• Jump Game II

  • 理解: x

• Gas Station

  • 理解: x

• Hand of Straights

  • 理解: o

• Merge Triplets to From Target Triplet

  • 理解: o

• Partition Labels

  • 理解: x

• Valid Parenthesis String

  • 理解: o

Intervals

• Insert Interval

  • 理解: o

• Merge Intervals

  • 理解: o

• Non Overlapping Intervals

  • 理解: o

• Meeting Rooms

  • 初見: o
  • 理解: o

• Meeting Rooms II

  • 初見: x
  • 理解: x

• Minimum Interval to Include Each Query

  • 初見: x
  • 理解: x

Math & Geometry

• Rot Image

  • 理解: o

• Spiral Matrix

  • 理解: o

• Set Matrix Zeroes

  • 理解: o

• Happy number

  • 理解: x

• Plus One

  • 理解: x

• Pow

  • 理解: x

• Multiply Strings

  • 理解: o

Bit Manipulation

• Single Number

  • 理解: o

• Number of 1 Bits

  • 理解: o

• Counting Bits

  • 理解: o

• Reverse Bits

  • 理解: x

• Sum of Two Integers

  • 理解: o

• Reverse Integer

  • 理解: o