![演算法 [Java] LeetCode #205. Isomorphic Strings](https://allenhsieh1992.com/images/leetcode.webp)
Given two strings s and t, determine if they are isomorphic.
![演算法 [Java] LeetCode #205. Isomorphic Strings](https://allenhsieh1992.com/images/leetcode.webp)
Given two strings s and t, determine if they are isomorphic.
![演算法 [Java] LeetCode #392. Is Subsequence](https://allenhsieh1992.com/images/leetcode.webp)
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
![演算法 [Java] LeetCode #724. Find Pivot Index](https://allenhsieh1992.com/images/leetcode.webp)
Given an array of integers nums, calculate the pivot index of this array.
![演算法 [Java] LeetCode #12. Integer to Roman](https://allenhsieh1992.com/images/leetcode.webp)
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
![演算法 [Java] LeetCode #13. Roman to Integer](https://allenhsieh1992.com/images/leetcode.webp)
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.