기록용 기술 블로그

https://leetcode.com/problems/isomorphic-strings/description/ Isomorphic Strings - LeetCode Isomorphic Strings - Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving th leetcode.com 문제 Given two strings s and t, determ..

https://leetcode.com/problems/remove-palindromic-subsequences/description/ Remove Palindromic Subsequences - LeetCode Remove Palindromic Subsequences - You are given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s. Return the minimum number of steps to make the given string empty. A string is a subseque leetcode.com 문제 You are..

https://leetcode.com/problems/two-sum/description/ Two Sum - LeetCode Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return leetcode.com 문제 Given an array of integers nums and an integer target, re..

https://leetcode.com/problems/roman-to-integer/description/ Roman to Integer - LeetCode Roman to Integer - Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII leetcode.com 문제 Roman numerals are represented by seven d..