소프트웨어에 대한 모든 것

문제) 1704. Determine if String Halves Are Alike You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half. Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'). Notice that s contains uppercase and lowercase letters. Return true if a and b are alike. O..

문제) 931. Minimum Falling Path Sum Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first row and chooses the element in the next row that is either directly below or diagonally left/right. Specifically, the next element from position (row, col) will be (row + 1, col - 1), (row + 1, col), or (row + 1, c..

문제) 2432. The Employee That Worked on the Longest Task There are n employees, each with a unique id from 0 to n - 1. You are given a 2D integer array logs where logs[i] = [idi, leaveTimei] where: idi is the id of the employee that worked on the ith task, and leaveTimei is the time at which the employee finished the ith task. All the values leaveTimei are unique. Note that the ith task starts the..

문제) 1026. Maximum Difference Between Node and Ancestor Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b. Example 1: Input: root = [8,3,10,1,6,null,14,null,null,4,7,13] Output: 7 Expla..

6. Zigzag Conversion https://leetcode.com/problems/zigzag-conversion/description/ Zigzag Conversion - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) numRows 수 만큼 배열을 생성해서 문자열을 순회하면서 배열에 아래로/위로 움직이면서 문자를 추가 class Solution: def convert(self, s: str, numRows: int) -> str: r..

https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/ Minimum Moves to Equal Array Elements II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 462. Minimum Moves to Equal Array Elements II 문제) 솔루션1) 1) 오름차순 정렬 2) 중앙값 검색 3) 중앙값을 기준으로 각 elements에 대해서 move 계산 class..

상대 의견에 반대할 때 상대의 감정이 다치지 않게 반대하는 대화법! PCS 반대법 - Positivity : 상대방의 의견의 장점에 공감 또는 인정 - Concern : 상대방의 의견을 수용할 때 야기되는 염려나 단점을 설명 - Suggestion : 열려사항을 피해갈 수 있는 자신의 의견을 제안 요약하자면, 상대방의 주장에 센스있게 반대하는 대화법 꼭 직장에서만 사용하는 대화법이 아닌, 친구나 와이프 아이들과도 센스있게 대화할 수 있는 방법 출처 : 리더는 어떻게 말하는가 https://www.coupang.com/vp/products/34474659?itemId=128663935&vendorItemId=3267155581&src=1042503&spec=10304982&addtag=400&ctag=34..

5. Longest Palindromic Substring https://leetcode.com/problems/longest-palindromic-substring/ 문제) 솔루션1) middle 문자를 정하고 왼쪽, 오른쪽 포인터를 정해서 비교해서 동일한 문자면 한 칸씩 이동하면서 회문임을 확인한다. 시간 복잡도 : O(n*n) class Solution: def longestPalindrome(self, s: str) -> str: def get_palindrome(left, right): # 왼쪽, 오른쪽으로 이동하면서 회문을 탐색 while left >= 0 and right < len(s) and s[left] == s[right]: left -= 1 right += 1 return s[lef..