jhphon0730

DescriptionEasyTopicsCompaniesGiven a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You must write an algorithm with O(log n) runtime complexity. Example 1:Input: nums = [1,3,5,6], target = 5Output: 2Example 2:Input: nums = [1,3,5,6], target = 2Output: 1Example 3:Input: nums =..

DescriptionEasyTopicsCompaniesHintGiven an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things:Change the array nums such tha..

DescriptionYou are given the heads of two sorted linked lists list1 and list2.Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.Return the head of the merged linked list. Example 1:Input: list1 = [1,2,4], list2 = [1,3,4]Output: [1,1,2,3,4,4]Example 2:Input: list1 = [], list2 = []Output: []Example 3:Input: list1 = [], list2 = [..

Description20. Valid ParenthesesEasyTopicsCompaniesHintGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets.Open brackets must be closed in the correct order.Every close bracket has a corresponding open bracket of the same type. Example 1:Input:..

DescriptionEasyTopicsCompaniesWrite a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string "". Example 1:Input: strs = ["flower","flow","flight"]Output: "fl"Example 2:Input: strs = ["dog","racecar","car"]Output: ""Explanation: There is no common prefix among the input strings. Constraints:1 Codepackage main import ( "f..

DescriptionRoman numerals are represented by seven different symbols: , , , , , and .IVXLCDMSymbol ValueI 1V 5X 10L 50C 100D 500M 1000For example, is written as in Roman numeral, just two ones added together. is written as , which is simply . The number is written as , which is .2II12XIIX + II27XXVIIXX + ..

DescriptionGiven an integer , return if is a xtruexpalindrome, and otherwise.false Example 1:Input: x = 121Output: trueExplanation: 121 reads as 121 from left to right and from right to left.Example 2:Input: x = -121Output: falseExplanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.Example 3:Input: x = 10Output: falseExplanation: Re..

DescriptionYou are given an integer array nums and an integer k.In one operation, you can choose any index i where 0 Codefunc smallestRangeI(nums []int, k int) int { min, max := nums[0], nums[0] for _, num := range nums { if num max { max = num } } if min+k >= max-k { return 0 } return (max - k) - (min + k)} smallestRangeI 함수는 배열 nums의 모든 요소에 대해 최소한의 조정을 통해 배열의 최대값과 최소값의 차이를 k 이하로 만들 때, 조..

DescriptionThere are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holding the pillow passes it to the next person standing in the line. Once the pillow reaches the end of the line, the direction changes, and people continue passing the pillow in the opposite direction.For example, once the pillow reaches the..

DescriptionYou are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique.The athletes are placed based on their scores, where the 1st place athlete has the highest score, the 2nd place athlete has the 2nd highest score, and so on. The placement of each athlete determines their rank:The 1st place athlete..