1. Longest Substring Without Repeating Characters:
   Find the length of the longest substring without repeating characters in a given string.
   https://leetcode.com/problems/longest-substring-without-repeating-characters/

2. Minimum Window Substring:
   Given a string S and a string T, find the minimum window in S that contains all the characters of T.
   https://leetcode.com/problems/minimum-window-substring/

3. Regular Expression Matching:
   Implement regular expression matching with support for '.' and '*'.
   https://leetcode.com/problems/regular-expression-matching/

4. Edit Distance:
   Determine the minimum number of operations required to convert one string into another, where operations include insert, delete, and replace.
   https://leetcode.com/problems/edit-distance/

5. String to Integer (atoi):
   Implement the atoi function which converts a string to an integer.
   https://leetcode.com/problems/string-to-integer-atoi/

6. Group Anagrams:
   Given an array of strings, group anagrams together.
   https://leetcode.com/problems/group-anagrams/

7. Longest Palindromic Substring:
   Find the longest palindromic substring in a given string.
   https://leetcode.com/problems/longest-palindromic-substring/

8. ZigZag Conversion:
   Convert a given string into a zigzag pattern with a specified number of rows.
   https://leetcode.com/problems/zigzag-conversion/

9. Valid Parentheses:
   Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
   https://leetcode.com/problems/valid-parentheses/

10. String Compression:
    Implement a method to perform basic string compression using the counts of repeated characters. For example, the string "aabcccccaaa" would become "a2b1c5a3".
    https://leetcode.com/problems/string-compression/

Upvote for motivation