Leetcode problem 127 - Optimal Partition of String
Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a sin...
Jonghan's learning path
Today I Learned as a developer
Recent posts
Leetcode problem 126 - Count Number of Distinct Integers After Reverse Operations
You are given an array nums consisting of positive integers.
Leetcode problem 125 - Minimum Number of Steps to Make Two Strings Anagram
You are given two strings of the same length s and t. In one step you can choose any character of t and replace it with another character.
Leetcode problem 124 - Arithmetic Subarrays
A sequence of numbers is called arithmetic if it consists of at least two elements, and the difference between every two consecutive elements is the same. Mo...
Leetcode problem 123 - Encode and Decode TinyURL
Note: This is a companion problem to the System Design problem: Design TinyURL. TinyURL is a URL shortening service where you enter a URL such as https://lee...