Leetcode problem 97 - Strictly Palindromic Number
An integer n is strictly palindromic if, for every base b between 2 and n - 2 (inclusive), the string representation of the integer n in base b is palindromi...
Jonghan's learning path
Today I Learned as a developer
Recent posts
Leetcode problem 96 - Reverse String
Write a function that reverses a string. The input string is given as an array of characters s.
Leetcode problem 95 - Merge Strings Alternately
You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the othe...
Leetcode problem 94 - Find First Palindromic String in the Array
Given an array of strings words, return the first palindromic string in the array. If there is no such string, return an empty string “”.
Leetcode problem 93 - Reverse Prefix of Word
Given a 0-indexed string word and a character ch, reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inc...