꿈꾸는공학도

https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays/You are given two 0-indexed integer arrays nums1 and nums2 of length n.Let's define another 0-indexed integer array, nums3, of length n. For each index i in the range [0, n - 1], you can assign either nums1[i] or nums2[i] to nums3[i].Your task is to maximize the length of the longest non-decreasing subarray in nums3 by..

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-..

https://leetcode.com/problems/build-array-from-permutation/Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0  and return it.A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive). Example 1:Input: nums = [0,2,1,5,3,4]Output: [0,1,2,4,5,3]Explanation: The array ans is built a..

https://leetcode.com/problems/zigzag-conversion/description/The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I GY I RAnd then read line by line: "PAHNAPLSIIGYIR"Write the code that will take a string and make this conversion given a number of rows:..

https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/description/In a mystic dungeon, n magicians are standing in a line. Each magician has an attribute that gives you energy. Some magicians can give you negative energy, which means taking energy from you.You have been cursed in such a way that after absorbing energy from magician i, you will be instantly transported to ma..

https://leetcode.com/problems/determine-the-minimum-sum-of-a-k-avoiding-array/description/You are given two integers, n and k.An array of distinct positive integers is called a k-avoiding array if there does not exist any pair of distinct elements that sum to k.Return the minimum possible sum of a k-avoiding array of length n. Example 1:Input: n = 5, k = 4Output: 18Explanation: Consider the k-av..

Given a string s, return the longest palindromic substring in s. Example 1:Input: s = "babad"Output: "bab"Explanation: "aba" is also a valid answer.Example 2:Input: s = "cbbd"Output: "bb" Constraints:1 s consist of only digits and English letters.Topics: Two Pointers / String/ Dynamic Programming 1. Pythonclass Solution: def longestPalindrome(self, s: str) -> str: temp={} for i ..

https://leetcode.com/problems/add-two-numbers/description/You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example 1:Input: l1 = ..

https://eglife.tistory.com/41 4. Function ic C - Grammer https://eglife.tistory.com/40 3. Control Structures in C - Condition ( While / For Loop ) https://eglife.tistory.com/33 2-1. Operators / Memory in C https://eglife.tistory.com/32 2. Variables in C 아무리 봐도 불친절한 C.. 파이썬을 배우다가 eglife.tistory.com 파이썬과 C는 매우 다르다. C와 C++을 10년 이상 공부를 해도 한 2~3개월만 파이썬 하다보면 C, C++의 기본적인 내용도 순간 까먹을 수 있다. C의 가장 큰 특성? C..

https://eglife.tistory.com/40 3. Control Structures in C - Condition ( While / For Loop ) https://eglife.tistory.com/33 2-1. Operators / Memory in C https://eglife.tistory.com/32 2. Variables in C 아무리 봐도 불친절한 C.. 파이썬을 배우다가 와서 그런가 불편한 게 이만 저만이 아니다. 그래도 파이썬코드보 eglife.tistory.com If / Else / While 같은 건 C나 Python이나 비슷하다. 다만, Indentation / 중괄호로 구문을 구분하는 것들이 좀 차이가 있다. Python과 C에서 Function / Memory 부분이..