counting Problems | Design Gurus

Patterns

counting

29 problems

#	Title	Acceptance	Difficulty
1	Contains Duplicate (easy) hash map hash set array +2 more	55.5%	easy
2	Pangram (easy) string array hash map +1 more	31.0%	easy
3	Number of Good Pairs (easy) array counting hash map	75.4%	easy
4	Find all Missing Numbers (easy) array counting sorting +1 more	54.3%	easy
5	Problem Challenge 3: Find the First K Missing Positive Numbers (hard) array sorting recursion +2 more	16.7%	hard
6	Remove All Adjacent Duplicates in String II (medium) string stack recursion +2 more	37.0%	Med.
7	Sum of Subarray Minimums (medium) monotonic stack array stack +1 more	67.6%	Med.
8	Problem 1: First Non-repeating Character (easy) string hash map counting +1 more	55.3%	easy
9	Solution: First Non-repeating Character (easy) string hash map counting	0.0%	easy
10	Problem 2: Largest Unique Number (easy) hash map counting array +1 more	61.4%	easy
11	Solution: Largest Unique Number (easy) hash map counting array +1 more	0.0%	easy
12	Problem 3: Maximum Number of Balloons (easy) string hash map counting +1 more	39.7%	easy
13	Solution: Maximum Number of Balloons (easy) string hash map counting +1 more	0.0%	easy
14	Solution: Longest Palindrome(easy) string hash map array +1 more	0.0%	easy
15	Problem 5: Ransom Note (easy) string hash map counting +1 more	56.7%	easy
16	Solution: Ransom Note (easy) hash map string counting	0.0%	easy
17	Biggest Island (easy) matrix breadth-first search depth-first search +4 more	47.4%	easy
18	Single Number (easy) array hash map hash set +3 more	82.6%	easy
19	Two Single Numbers (medium) array sorting counting +1 more	68.1%	Med.
20	Frequency Sort (medium) sorting counting hash map +2 more	80.4%	Med.
21	Maximum Distinct Elements (medium) counting greedy algorithm array +1 more	22.7%	Med.
22	Problem Challenge 1: Rearrange String K Distance Apart (hard) greedy algorithm string queue +2 more	25.3%	hard
23	Remove Duplicate Letters (medium) string greedy algorithm monotonic stack +3 more	18.0%	Med.
24	Largest Palindromic Number (medium) greedy algorithm string counting +1 more	15.3%	Med.
25	Problem Challenge 1: Count of Subset Sum (hard) subsets dynamic programming recursion +2 more	55.6%	hard
26	Problem Challenge 2: Target Sum (hard) dynamic programming recursion backtracking +1 more	44.6%	hard
27	Subarray Sum Equals K (medium) prefix sum array hash map +1 more	45.2%	Med.
28	Best Time to Buy and Sell (easy) array two pointers greedy algorithm +1 more	51.2%	easy
29	Longest Consecutive Sequence (medium) hash set array counting	31.9%	Med.