string Problems | Design Gurus

Data Structures

string

56 problems

#	Title	Acceptance	Difficulty
1	Pangram (easy) string array hash map +1 more	31.0%	easy
2	Reverse Vowels (easy) string two pointers array +2 more	44.2%	easy
3	Valid Palindrome (easy) string two pointers	22.6%	easy
4	Valid Anagram (easy) sorting recursion hash map +1 more	38.4%	easy
5	Shortest Word Distance (easy) array string two pointers +3 more	27.8%	easy
6	Problem Challenge 2: Comparing Strings containing Backspaces (medium) string two pointers stack +1 more	16.8%	Med.
7	Longest Substring with K Distinct Characters (medium) sliding window string hash map +1 more	28.0%	Med.
8	Longest Substring with Same Letters after Replacement (hard) sliding window string greedy algorithm	29.8%	hard
9	Problem Challenge 1: Permutation in a String (hard) sliding window string hash map +1 more	16.2%	hard
10	Problem Challenge 2: String Anagrams (hard) string hash map sliding window +2 more	29.0%	hard
11	Problem Challenge 3: Smallest Window containing Substring (hard) sliding window string hash map +1 more	20.0%	hard
12	Problem Challenge 4: Words Concatenation (hard) string hash map two pointers +2 more	23.2%	hard
13	Reverse a LinkedList (easy) linked list recursion sorting +4 more	80.1%	easy
14	Problem 1: Balanced Parentheses (easy) stack string depth-first search +1 more	30.1%	easy
15	Problem 2: Reverse a String (easy) stack string	85.1%	easy
16	Problem 3: Decimal to Binary Conversion (medium) binary search array string	46.7%	Med.
17	Problem 6: Simplify Path (medium) stack string simulation	25.2%	Med.
18	Remove All Adjacent Duplicates In String (easy) stack string array +1 more	58.6%	easy
19	Remove All Adjacent Duplicates in String II (medium) string stack recursion +2 more	37.0%	Med.
20	Remove K Digits (hard) greedy algorithm stack string +1 more	12.6%	hard
21	Problem 1: First Non-repeating Character (easy) string hash map counting +1 more	55.3%	easy
22	Solution: First Non-repeating Character (easy) string hash map counting	0.0%	easy
23	Problem 3: Maximum Number of Balloons (easy) string hash map counting +1 more	39.7%	easy
24	Solution: Maximum Number of Balloons (easy) string hash map counting +1 more	0.0%	easy
25	Problem 4: Longest Palindrome(easy) string array hash map +1 more	24.1%	easy
26	Solution: Longest Palindrome(easy) string hash map array +1 more	0.0%	easy
27	Problem 5: Ransom Note (easy) string hash map counting +1 more	56.7%	easy
28	Solution: Ransom Note (easy) hash map string counting	0.0%	easy
29	Permutations (medium) recursion backtracking array +2 more	58.9%	Med.
30	String Permutations by changing case (medium) recursion backtracking string +2 more	56.7%	Med.
31	Balanced Parentheses (hard) backtracking recursion string	27.9%	hard
32	Unique Generalized Abbreviations (hard) backtracking recursion string +2 more	70.2%	hard
33	Next Letter (medium) binary search array string +1 more	36.9%	Med.
34	Frequency Sort (medium) sorting counting hash map +2 more	80.5%	Med.
35	Rearrange String (hard) top k elements greedy algorithm heap +3 more	44.5%	hard
36	Problem Challenge 1: Rearrange String K Distance Apart (hard) greedy algorithm string queue +2 more	25.3%	hard
37	Valid Palindrome II (easy) string recursion two pointers +1 more	33.1%	easy
38	Minimum Add to Make Parentheses Valid (medium) string stack recursion +2 more	48.3%	Med.
39	Remove Duplicate Letters (medium) string greedy algorithm monotonic stack +3 more	18.0%	Med.
40	Largest Palindromic Number (medium) greedy algorithm string counting +1 more	15.3%	Med.
41	Split a String Into the Max Number of Unique Substrings (medium) string backtracking recursion +2 more	44.3%	Med.
42	Implement Trie (Prefix Tree) (medium) trie string n-ary tree	64.8%	Med.
43	Index Pairs of a String (easy) string string matching trie +3 more	30.5%	easy
44	Design Add and Search Words Data Structure (medium) trie string depth-first search +3 more	35.5%	Med.
45	Extra Characters in a String (medium) string dynamic programming recursion +1 more	53.0%	Med.
46	Search Suggestions System (medium) string trie sorting +3 more	36.8%	Med.
47	Valid Parentheses (easy) stack string simulation +1 more	38.0%	easy
48	Group Anagrams (medium) string hash map sorting +1 more	75.6%	Med.
49	Decode String (medium) recursion string backtracking +1 more	45.2%	Med.
50	Palindromic Substrings (medium) dynamic programming string matching array +1 more	32.9%	Med.
51	Decode Ways (medium) dynamic programming recursion string +1 more	17.2%	Med.
52	Word Break (medium) dynamic programming recursion string +1 more	40.7%	Med.
53	Encode and Decode Strings (medium) string array	66.1%	Med.
54	Implement Trie (Prefix Tree) (medium) trie string n-ary tree	64.8%	Med.
55	Design Add and Search Words Data Structure (medium) trie string depth-first search +3 more	35.5%	Med.
56	Longest Valid Parentheses (hard) stack string breadth-first search +3 more	15.7%	hard