Code Challenges

Coding Challenges

Select a problem, write code, run test cases, and submit your solution.

Guru

Implement the `regularExpressionMatch` method that checks full string matching with dot and star pattern rules.

Learner

Implement the `romanNumeralToInteger` method that converts a Roman numeral string into an integer.

Learner

Implement the `checkStringRotation` method that checks whether one string is a rotation of another string.

Learner

Implement the `firstUniqueCharacterIndex` method that returns the index of the first character that appears only once.

Proficient

Implement the `minimumWindowContainsPatternLength` method that returns the length of the smallest substring containing all pattern characters.

Intermediate

Implement the `stringCompressionLength` method that returns the length after compressing consecutive repeated characters.

Learner

Implement the `validPalindromeAlphanumeric` method that checks whether a text is a palindrome after ignoring non-alphanumeric characters.

Intermediate

Implement the `longestPalindromicSubstringLength` method that returns the length of the longest palindromic substring.

Intermediate

Implement the `groupAnagramCount` method that counts how many anagram groups are formed from the words.

Learner

Implement the `validAnagramCheck` method that checks whether two strings are anagrams.

Intermediate

Implement the `longestSubstringNoRepeat` method that returns the length of the longest substring without repeated characters.

Intermediate

Implement the `countPatternOccurrences` method that counts how many times a pattern appears inside the given text.

Learner

Implement the `isRotationOfString` method that checks whether one string can be formed by rotating the other string.

Guru

Code Challenges

Get better at coding with practice problems.

Coding Challenges

Implement the `regularExpressionMatch` method that checks full string matching with dot and star pattern rules.

Implement the `romanNumeralToInteger` method that converts a Roman numeral string into an integer.

Implement the `checkStringRotation` method that checks whether one string is a rotation of another string.

Implement the `firstUniqueCharacterIndex` method that returns the index of the first character that appears only once.

Implement the `minimumWindowContainsPatternLength` method that returns the length of the smallest substring containing all pattern characters.

Implement the `stringCompressionLength` method that returns the length after compressing consecutive repeated characters.

Implement the `validPalindromeAlphanumeric` method that checks whether a text is a palindrome after ignoring non-alphanumeric characters.

Implement the `longestPalindromicSubstringLength` method that returns the length of the longest palindromic substring.

Implement the `groupAnagramCount` method that counts how many anagram groups are formed from the words.

Implement the `validAnagramCheck` method that checks whether two strings are anagrams.

Implement the `longestSubstringNoRepeat` method that returns the length of the longest substring without repeated characters.

Implement the `countPatternOccurrences` method that counts how many times a pattern appears inside the given text.

Implement the `isRotationOfString` method that checks whether one string can be formed by rotating the other string.

Implement the method `isWildcardMatch` that checks whether a string matches a wildcard pattern.

Code Challenges

Get better at coding with practice problems.

Coding Challenges

Implement the regularExpressionMatch method that checks full string matching with dot and star pattern rules. Solved

Implement the romanNumeralToInteger method that converts a Roman numeral string into an integer. Solved

Implement the checkStringRotation method that checks whether one string is a rotation of another string. Solved

Implement the firstUniqueCharacterIndex method that returns the index of the first character that appears only once. Solved

Implement the minimumWindowContainsPatternLength method that returns the length of the smallest substring containing all pattern characters. Solved

Implement the stringCompressionLength method that returns the length after compressing consecutive repeated characters. Solved

Implement the validPalindromeAlphanumeric method that checks whether a text is a palindrome after ignoring non-alphanumeric characters. Solved

Implement the longestPalindromicSubstringLength method that returns the length of the longest palindromic substring. Solved

Implement the groupAnagramCount method that counts how many anagram groups are formed from the words. Solved

Implement the validAnagramCheck method that checks whether two strings are anagrams. Solved

Implement the longestSubstringNoRepeat method that returns the length of the longest substring without repeated characters. Solved

Implement the countPatternOccurrences method that counts how many times a pattern appears inside the given text. Solved

Implement the isRotationOfString method that checks whether one string can be formed by rotating the other string. Solved

Implement the method isWildcardMatch that checks whether a string matches a wildcard pattern. Solved

Implement the `regularExpressionMatch` method that checks full string matching with dot and star pattern rules.

Implement the `romanNumeralToInteger` method that converts a Roman numeral string into an integer.

Implement the `checkStringRotation` method that checks whether one string is a rotation of another string.

Implement the `firstUniqueCharacterIndex` method that returns the index of the first character that appears only once.

Implement the `minimumWindowContainsPatternLength` method that returns the length of the smallest substring containing all pattern characters.

Implement the `stringCompressionLength` method that returns the length after compressing consecutive repeated characters.

Implement the `validPalindromeAlphanumeric` method that checks whether a text is a palindrome after ignoring non-alphanumeric characters.

Implement the `longestPalindromicSubstringLength` method that returns the length of the longest palindromic substring.

Implement the `groupAnagramCount` method that counts how many anagram groups are formed from the words.

Implement the `validAnagramCheck` method that checks whether two strings are anagrams.

Implement the `longestSubstringNoRepeat` method that returns the length of the longest substring without repeated characters.

Implement the `countPatternOccurrences` method that counts how many times a pattern appears inside the given text.

Implement the `isRotationOfString` method that checks whether one string can be formed by rotating the other string.

Implement the method `isWildcardMatch` that checks whether a string matches a wildcard pattern.