전체 글 131

Week 2-2. [Binary Search] 33. Search in Rotated Sorted Array (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/search-in-rotated-sorted-array/?envType=study-plan-v2&envId=top-interview-150 Search in Rotated Sorted Array - LeetCode Can you solve this real interview question? Search in Rotated Sorted Array - There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possib..

💫 ETC/Leetcode 2023.09.05

Week 2-2. [Divide & Conquer] 148. Sort List (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/sort-list/?envType=study-plan-v2&envId=top-interview-150 Sort List - LeetCode Can you solve this real interview question? Sort List - Given the head of a linked list, return the list after sorting it in ascending order. Example 1: [https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg] Input: head = [4,2,1,3] Output: [1, ..

💫 ETC/Leetcode 2023.09.04

Week 2-1. [Hash Table] 242. Valid Anagram (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/valid-anagram/?envType=study-plan-v2&envId=top-interview-150 Valid Anagram - LeetCode Can you solve this real interview question? Valid Anagram - Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typic..

💫 ETC/Leetcode 2023.09.01

Week 2-1. [Hash Table] 383. Ransom Note (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/ransom-note/?envType=study-plan-v2&envId=top-interview-150 Ransom Note - LeetCode Can you solve this real interview question? Ransom Note - Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine and false otherwise. Each letter in magazine can only be used once in..

💫 ETC/Leetcode 2023.09.01

Week 2-1. [Hash Table] 219. Contains Duplicate II (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/contains-duplicate-ii/description/?envType=study-plan-v2&envId=top-interview-150 Contains Duplicate II - LeetCode Can you solve this real interview question? Contains Duplicate II - Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(..

💫 ETC/Leetcode 2023.08.30

Week 2-1. [Hash Table] 1. Two Sum (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/two-sum/?envType=study-plan-v2&envId=top-interview-150 Two Sum - LeetCode Can you solve this real interview question? Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not le..

💫 ETC/Leetcode 2023.08.30

[원티드 프리온보딩 인턴십] Week 2-1. 소소한 데브톡 기록

git commit history 커밋 헤드와 바디까지 적고, 가능하면 rebase를 사용해서 깔끔하게 관리하기 4개의 커밋을 하나의 커밋으로 하고 싶으면 rebase 해서.. "문제가 생겼을 때 커밋 히스토리를 보려고 하는구나" 라는 느낌이 들어야 한다. 커밋 메시지를 작업 보고서로 간주해야 한다. 문제가 발생하면 커밋 기준으로 빠르게 롤백 시킬 수 있어야 한다. 따라서 간결하고 충분한 정보를 제공해야 한다. 간단한 오탈자 수정도 다른 기능 개발 커밋에 끼워넣지 않는게 좋다. PR 실제로 커밋 빨리 하고 싶고 PR 빨리 써서 머지해버리고 싶은데 그 충동을 잘 이겨내야 한다!!!! 실무에서는 더더욱!!! PR에 피그마/노션에 있는 화면 캡쳐해주면 좋다. 리뷰어가 다른 문서를 찾아보지 않고 PR만 보면 되..

Week 1-2. [Stack] 150. Evaluate Reverse Polish Notation (Python)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/evaluate-reverse-polish-notation/?envType=study-plan-v2&envId=top-interview-150 Evaluate Reverse Polish Notation - LeetCode Can you solve this real interview question? Evaluate Reverse Polish Notation - You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation [http://en.wikiped..

💫 ETC/Leetcode 2023.08.29

Week 1-2. [Stack] 155. Min Stack (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/min-stack/?envType=study-plan-v2&envId=top-interview-150 Min Stack - LeetCode Can you solve this real interview question? Min Stack - Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: * MinStack() initializes the stack object. * void push(int val) pushes..

💫 ETC/Leetcode 2023.08.29

Week 1-2. [Linked List] 21. Merge Two Sorted Lists (Python3)

문제 해결 과정 ✍️ 나만의 방식으로 문제 정리하기 (=체계화) https://leetcode.com/problems/merge-two-sorted-lists/ Merge Two Sorted Lists - LeetCode Can you solve this real interview question? Merge Two Sorted Lists - You 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 leetcode.com 두 개의..

💫 ETC/Leetcode 2023.08.29