LeetCode 970: Powerful Integers
A clear explanation of generating all powerful integers using bounded powers and a set.
9 notes
A clear explanation of generating all powerful integers using bounded powers and a set.
A clear explanation of counting super-palindromes by generating palindromic roots and checking their squares.
An enumeration solution for reconstructing all valid coordinate pairs after commas, spaces, and decimal points were removed.
Find the next valid 24-hour time using only the digits from the current time.
A clear explanation of Split Concatenated Strings using string reversal choices and enumeration of every possible cut point.
A clear explanation of finding the largest palindrome made from the product of two n-digit numbers by generating palindrome candidates directly.
A clear explanation of finding the shortest abbreviation that does not conflict with any dictionary word using bit masks.
A clear explanation of the Binary Watch problem using bit counting over all valid times.
A clear explanation of Additive Number using split enumeration and deterministic checking.