---
# System prepended metadata

title: PROBLEM

---

# PROBLEM
## Static
## Lambda Expresstion 
>[LeetCode 791. Custom Sort String](/RKe38mmnREmVkGWk5k5NHw)

## lower_bound / upper_bound 
>[LeetCode 300. Longest Increasing Subsequence ](/NMghlvP3SQStf5T_4sIxpQ)

## Binary Search 
>[LeetCode 658. Find K Closest Elements ](/KnZ4IgPuQlqbcaJ6yHckhQ)
>[LeetCode 300. Longest Increasing Subsequence ](/NMghlvP3SQStf5T_4sIxpQ)
>[LeetCode 378. Kth Smallest Element in a Sorted Matrix](/TGRcX8VsRrCqsIigtppp6A)
>[LeetCode 162. Find Peak Element](/8gT90xrrRoO1QK5FwfzlMw)

## K Sum 
>[LeetCode 18. 4Sum](/vqGbrlGvREGrmd2GaEFoUg)
>[LeetCode 16. 3Sum Closest ](/McJLv7t3QTCRvQDj1XZduA)
>[LeetCode 1. Two Sum](/x3Buh48JRQaLo36-rLxpog)

## Kadane Algorithm ( Max Sum of Rectangle )
>[LeetCode 363. Max Sum of Rectangle No Larger Than K](/_RkR0WLdSlGm1sd06c2x_Q)

## Sliding Window
>[LeetCode 76. Minimum Window Substring ](/cI7Y_dG6RbKLBHtVqztwjg)

## Reverse Linked List
>[LeetCode 25. Reverse Nodes in k-Group](/p2ZgOu76Tc2vf8yJThHbsw)
>[LeetCode 92. Reverse Linked List II ](/SpRs-_hLSGK79Fe914TEoQ)

## LIS ( Longest Increasing Subsequence ) 
>[LeetCode 300. Longest Increasing Subsequence ](/NMghlvP3SQStf5T_4sIxpQ)

## Gray Code
>[LeetCode 89. Gray Code ](/UW8LB8SfSi6s_V01lkxjOQ)

## 矩陣快速冪
>[求 n = 10^18^項 Fibonacci Sequence](https://hackmd.io/68bQ77GLRmij3gHisox2Ew)

## Fisher-Yates Algorithm ( 洗牌演算法 )
[LeetCode 384. Shuffle an Array ](/ycF2aoX3S0GlO--Leun9hQ)

## Min Heap / Max Heap 
>[LeetCode 1383. Maximum Performance of a Team ](/BaUbRo4vTdi69qpEyTFvEg)
>[LeetCode 857. Minimum Cost to Hire K Workers ( HARD ) ](/TsqkcrqrS2-tIhEQXIYM0A)
>[LeetCode 378. Kth Smallest Element in a Sorted Matrix](/TGRcX8VsRrCqsIigtppp6A)
>[LeetCode 295. Find Median from Data Stream](/lEvcJM4KQqqusyJom4htmg)

## Tree
>[LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal ](/qJgJR9ZDR6OFw5dtycZQtw)
>[LeetCode 814. Binary Tree Pruning ](/YtEeWrXERfKz1twzGkePUQ)
>[LeetCode 235. Lowest Common Ancestor of a Binary Search Tree ](/EzjrR5nMTGyU1FbMIRQA3w)
>[LeetCode 108. Convert Sorted Array to Binary Search Tree ](/SAakAVtfRyunURADtYesXQ)
>[LeetCode 429. N-ary Tree Level Order Traversal ](/AqJWxvT9S2yCoBsxCtpwXQ)
>[LeetCode 1339. Maximum Product of Splitted Binary Tree](/WHvxDkWCTRKG1iK6rIE1UA)

## Trie
>[LeetCode 677. Map Sum Pairs ](/rGwU7BmrRLaUS4JbNBf8Fw)

## deque 
>[LeetCode 1696. Jump Game VI ](/RLA1E2geSMuJRU_cnKa5og)

## Bit Manipulation 
>[LeetCode 600. Non-negative Integers without Consecutive Ones ](/8ZxksjqESLi6FtgXtO2pYw)

## BFS or DFS 
>[LeetCode 126. Word Ladder II ](/PJl5AUzJTvKurC5SbP4QBA)
>[LeetCode 752. Open the Lock ](/e51EZudLRYmxf6Y_tFqiVA)
>[LeetCode 695. Max Area of Island ](/vaxJ1dFESE-iLIGbgqApQQ)
>[LeetCode 827. Making A Large Island ](/mVbVKbJXQkS7_zjrLWexdA)
>[LeetCode 113. Path Sum II ](/hM9FyZEdTCKG-6sCkfltUg)
>[LeetCode 1339. Maximum Product of Splitted Binary Tree](/WHvxDkWCTRKG1iK6rIE1UA)

## DP 
>[LeetCode 1696. Jump Game VI ](/RLA1E2geSMuJRU_cnKa5og)
>[LeetCode 746. Min Cost Climbing Stairs ](/FNYhILkYS9mJVl2lpwcNfg)
>[LeetCode 97. Interleaving String ](/klcLyGEvRK-lqzRcYihT0g)
>[LeetCode 639. Decode Ways II](/7fnWXSEKQ1KusedPxbmTHA)
>[LeetCode 1220. Count Vowels Permutation](/Fdms2-QWRiCoX2ZFPbg6Zg)
>[LeetCode 718. Maximum Length of Repeated Subarray](/kfFn3GX1ScS9SXt5rB1lEw)
>[LeetCode 877. Stone Game ](/hAiZc4GsTYmSQHfq6ed_3Q)
>[LeetCode 132. Palindrome Partitioning II ](/ph9R7XRiQ2K20sjjvba07A)

## Hash Map / Set 
>[LeetCode 128. Longest Consecutive Sequence ](/lZEnI5kcT92i7NhVVW4xmw)
>[LeetCode 295. Find Median from Data Stream](/lEvcJM4KQqqusyJom4htmg)
>[LeetCode 1338. Reduce Array Size to The Half](/f5tIynIqTjOBRkYm74gXUA)
>[LeetCode 677. Map Sum Pairs ](/rGwU7BmrRLaUS4JbNBf8Fw)
>[LeetCode 954. Array of Doubled Pairs ](/kzCvm52dSfiwne9wZ4Uy6g)
>[LeetCode 49. Group Anagrams ](/oN1T9BkqSEiQxUMj76OD_w)

## Two Pointer 
>[LeetCode 128. Longest Consecutive Sequence ](/lZEnI5kcT92i7NhVVW4xmw)
>[LeetCode 915. Partition Array into Disjoint Intervals ](/Dg4FXIWESH-Ig1IuVHUFUg)
>[LeetCode 838. Push Dominoes ](/PxA5OJzKTyGgwScpLp6Y8g)
>[LeetCode 658. Find K Closest Elements ](/KnZ4IgPuQlqbcaJ6yHckhQ)
>[LeetCode 611. Valid Triangle Number](/AA4ty7fRSmGfeJLzw221cA)
>[LeetCode 42. Trapping Rain Water ](/FnPVP2LDR0WhQ1rePJ5GHw)

## Stack
>[LeetCode 42. Trapping Rain Water ](/FnPVP2LDR0WhQ1rePJ5GHw)

## Array
>[LeetCode 927. Three Equal Parts](/AzRsvwQQSam1msSpQOWAuA)
>[LeetCode 932. Beautiful Array ](/NPBL_hj9Trq9tpqauiAaQw)

## Others
>[LeetCode 566. Reshape the Matrix](/UswjgLt9Qa6HHnTN0DStEA)


## Array
>[LeetCode 90. Subsets II](/vdxWVfTaQe2fUoGv8nvqOA)


## string
>[LeetCode 415. Add Strings](/Y5NvSnTFSsGrCpJtyJBgvw)
>[LeetCode 926. Flip String to Monotone Increasing ](/E2FWMrADRXGP2BvIEUqafg)

## Matrix
>[LeetCode 73. Set Matrix Zeroes ](/AKHhSJNBRo6JXP8x99u2eA) ( by in-place )

## :star:  Union
>[LeetCode 1632. Rank Transform of a Matrix](/EGfCGZpMSpyszBSlF4MqSQ)