modalsoul’s blog

これは“失敗”と呼べるかもしれないが、ぼくは“学習体験”と呼びたい

2022-03-01から1ヶ月間の記事一覧

LeetCode 17. Letter Combinations of a Phone Number

LeetCode Problem No.17 No.16 is here modalsoul.hatenablog.com 17. Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return th…

LeetCode 16. 3Sum Closest

LeetCode Problem No.16 No.15 is here modalsoul.hatenablog.com 16. 3Sum Closest Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three i…

LeetCode 15. 3Sum

LeetCode Problem No.15 No.14 is here modalsoul.hatenablog.com 15. 3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that…

LeetCode 14. Longest Common Prefix

LeetCode Problem No.14. No.13 is here. modalsoul.hatenablog.com 14. Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Examp…

LeetCode 13. Roman to Integer

LeetCode Problem No.13. No.12 is here. modalsoul.hatenablog.com 13. Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Given a roman numeral, convert it to an integer. Example 1 Input: s = "…