Jonghan's learning path

Today I Learned as a developer

Recent posts

Leetcode problem 71 - Merge Sorted Array

2 minute read

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and ...

Leetcode problem 70 - Destination City

1 minute read

You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, t...

Leetcode problem 69 - Partition Labels

2 minute read

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part.