분류 전체보기 (2361) 썸네일형 리스트형 2026.08.14 11:55기상 늦었다12:05대충 앉아있다가 청소할 준비를 한다13:532,6번 항목에 대해 빨리 수정해서 배포하려고 출근했다. 바로 단톡방에 대표님이 연락왔다. 뭐 여러가지 안된다고 하셨다. 안드로이드 결제는 오늘부터 안되다고 원인을 물어보셨다. 상황파악을 했었다. 내가 봤을 때는 2주전에 없던 빨간 네모 표시가 생겼다. 이에 대해 언제부터 되었었고 언제부터 안되었냐고 여쭤봤다. 3달전부터 문제였는데 코드 문제가 아니라 google store의 인 앱 결제 프로필 문제를 해결안해서 정지된 듯 하다. 답변해줬다. 결제부터 해결하라고. 한편 배팀장님이 tag를 2.4.0..2.4.2까지 안따서 따달라고 부탁드렸다. 내 2,6번 항목은 각각 그룹미팅 채팅방 알람끄기 기능 추가랑 cms에서 그룹미팅 쪽 '일시.. (Python3) - LeetCode (Easy) : 3090. Maximum Length Substring With Two Occurrences https://leetcode.com/problems/maximum-length-substring-with-two-occurrences Maximum Length Substring With Two Occurrences - LeetCodeCan you solve this real interview question? Maximum Length Substring With Two Occurrences - Given a string s, return the maximum length of a substring such that it contains at most two occurrences of each character. Example 1: Input: s = "bcbbbcba" Outleetcode.com.. 2026.08.13 보호되어 있는 글입니다. (Python3) - LeetCode (Easy) : 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum Smallest Missing Integer Greater Than Sequential Prefix Sum - LeetCodeCan you solve this real interview question? Smallest Missing Integer Greater Than Sequential Prefix Sum - You are given a 0-indexed array of integers nums. A prefix nums[0..i] is sequential if, for all 1 leetcode.com간단 구현문제였습니다.📕 풀이방법📔 .. (Python3) - LeetCode (Medium) : 1140. Stone Game II https://leetcode.com/problems/stone-game-ii Stone Game II - LeetCodeCan you solve this real interview question? Stone Game II - Alice and Bob continue their games with piles of stones. There are a number of piles arranged in a row, and each pile has a positive integer number of stones piles[i]. The objective of the game isleetcode.commemoization dp로 해결한 문제였습니다📕 풀이방법📔 입력 및 초기화📑 memoization을 위한.. (Python3) - LeetCode (Medium) : 3310. Remove Methods From Project https://leetcode.com/problems/remove-methods-from-project Remove Methods From Project - LeetCodeCan you solve this real interview question? Remove Methods From Project - You are maintaining a project that has n methods numbered from 0 to n - 1. You are given two integers n and k, and a 2D integer array invocations, where invocations[i] = [ai, bi] indleetcode.comstack dfs로 해결한 문제였습니다.📕 풀이방법📔 입력.. (Python3) - LeetCode (Easy) : 3731. Find Missing Elements https://leetcode.com/problems/find-missing-elements Find Missing Elements - LeetCodeCan you solve this real interview question? Find Missing Elements - You are given an integer array nums consisting of unique integers. Originally, nums contained every integer within a certain range. However, some integers might have gone missing from theleetcode.comset 을 사용해본 문제였습니다. 값만 저장하는 자료구조로 저장 삽입 삭제가 O(1).. (Python3) - LeetCode (Easy) : 3014. Minimum Number of Pushes to Type Word I https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i Minimum Number of Pushes to Type Word I - LeetCodeCan you solve this real interview question? Minimum Number of Pushes to Type Word I - You are given a string word containing distinct lowercase English letters. Telephone keypads have keys mapped with distinct collections of lowercase English letters, whicleetcode.com비둘기집 원리를 생.. 이전 1 2 3 4 ··· 296 다음