꿈꾸는공학도

https://leetcode.com/problems/combination-sum-ii/?envType=daily-question&envId=2024-08-13Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target.Each number in candidates may only be used once in the combination.Note: The solution set must not contain duplicate combinations. Example 1:..

https://leetcode.com/problems/median-of-two-sorted-arrays/description/Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.The overall run time complexity should be O(log (m+n)). Example 1:Input: nums1 = [1,3], nums2 = [2]Output: 2.00000Explanation: merged array = [1,2,3] and median is 2.Example 2:Input: nums1 = [1,2], nums2 = [3,4]Outp..

https://leetcode.com/problems/search-in-rotated-sorted-array/description/There is an integer array nums sorted in ascending order (with distinct values).Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1  [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 a..

https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-ii/description/?envType=daily-question&envId=2024-08-06 You are given a string word containing lowercase English letters.Telephone keypads have keys mapped with distinct collections of lowercase English letters, which can be used to form words by pushing them. For example, the key 2 is mapped with ["a","b","c"], we need to push ..

https://leetcode.com/problems/kth-distinct-string-in-an-array/description/?envType=daily-question&envId=2024-08-05A distinct string is a string that is present only once in an array.Given an array of strings arr, and an integer k, return the kth distinct string present in arr. If there are fewer than k distinct strings, return an empty string "".Note that the strings are considered in the order ..

https://leetcode.com/problems/merge-k-sorted-lists/description/You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.Merge all the linked-lists into one sorted linked-list and return it. Example 1:Input: lists = [[1,4,5],[1,3,4],[2,6]]Output: [1,1,2,3,4,4,5,6]Explanation: The linked-lists are:[ 1->4->5, 1->3->4, 2->6]merging them into one sorted list:1-..

https://leetcode.com/problems/merge-sorted-array/description/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 nums2 respectively.Merge nums1 and nums2 into a single array sorted in non-decreasing order.The final sorted array should not be returned by the function, but instead be stored ins..

https://leetcode.com/problems/n-ary-tree-level-order-traversal/description/Given an n-ary tree, return the level order traversal of its nodes' values.Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples). Example 1:Input: root = [1,null,3,2,4,null,5,6]Output: [[1],[3,2,4],[5,6]]Example 2:Input: root = [1,..

https://leetcode.com/problems/largest-odd-number-in-string/description/You are given a string num, representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string "" if no odd integer exists.A substring is a contiguous sequence of characters within a string. Example 1:Input: num = "52"Output: "5"Explanation: The only non-..

코딩 문외한의 막가파식 코딩공부가 시작된다. Better Late Than Never! 이게 될라나.. 하고 고민할 시간에 코딩을 시작해보자! SW코딩을 할 때 그것이 적용될 HW의 구조를 몰라도 되는 것은 운영체제(Operation System)가 있기 때문이다. 그래서 우리는 자동차 구조를 몰라도 운전을 할 수 있는 운전자처럼 신나게 코딩을 할 수 있는 것이다. 운영체제를 다루는 일은 컴공 3학년 정도의 높은 수준이 요구되기에.. SKIP 파이썬은 OS와 Python Interpreter를 통해서 소통한다. 파이썬을 쓸 때 파이썬이 제공하는 Interface만 사용하면 된다. 그 기저에 있는 Coding Implenmentation은 굳이 몰라도 되어용! 이 점이 참 편하다고 한다. 이래서 파이썬~ ..