# DSA Problems Practice List ### News Language: C, C++ - [ ] [`lc-381`](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/description/) Insert Delete GetRandom O(1) - Duplicates allowed - Not to use: std::...map, std::...set - [ ] [`lc-706`](https://leetcode.com/problems/design-hashmap/) Design HashMap - Not to use: Same as above ### History - [v] `chef-PSHOT` Penalty Shoot-Out II - [v] `chef-STACKS` Stacks - [v] `lc-10` Regular Expression Matching - [v] `lc-1278` Palindrome Partitioning III - [v] `lc-146` LRU Cache - [v] `lc-1489` Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree - [v] `lc-1584` Min Cost to Connect All Points - [v] `lc-18` 4Sum - [v] `lc-208` Implement Trie - [v] `lc-218` The Skyline Problem - [v] `lc-221` Maximal Square - [v] `lc-239` Sliding Window Maximum - [v] `lc-295` Find Median from Data Stream - [v] `lc-307` Range Sum Query - Mutable - [v] `lc-4` Median of Two Sorted Arrays - [v] `lc-473` Matchsticks to Square - [v] `lc-6` Zigzag Conversion - [v] `lc-677` Map Sum Pairs - [v] `lc-684` Redundant Connection - [v] `lc-7` Reverse Integer - [v] `lc-739` Daily Temperatures - [v] `lc-743` Network Delay Time - [v] `lc-76` Minimum Window Substring - [v] `lc-778` Swim in Rising Water - [v] `lc-792` Number of Matching Subsequences - [v] `lc-8` String to Integer (atoi) - [v] `lc-82` Remove Duplicates From Sorted List II - [v] `lc-847` Shortest Path Visiting All Nodes - [v] `lc-86` Partition List - [v] `lc-9` Palindrome Number - [v] `lc-95` Unique Binary Search Trees II - [v] `poj-3253` Fence Repair - [v] `uva-104` Arbitrage - [v] `uva-10405` Longest Common Subsequence - [v] `uva-105` The Skyline Problem - [v] `uva-109` SCUD Busters - [v] `uva-119` Greedy Gift Givers - [v] `uva-222` Budget Travel - [v] `uva-489` Hangman judge - [v] `uva-575` Skew Binary - [v] `uva-702` The Vindictive Coach - [v] `zoj-a171` 打印樹 - [v] `zoj-b218` 找關鍵人物 - [v] `zoj-d526` Binary Search Tree (BST) - [v] `zoj-d841` 加分二叉树
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up