일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
- matrix
- 리트코드
- Python
- binary tree
- list
- 재귀
- DP
- easy
- Binary
- two pointers
- 이진트리
- binary search
- math
- 중간
- linked list
- sorting
- dfs
- backtracking
- HashTable
- Array
- recursive
- string
- leetcode
- 쉬움
- 문자열
- Medium
- tree
- hash table
- Depth-first Search
- 미디움
- Today
- Total
목록Algorithm/LeetCode (135)
부부의 코딩 성장 일기
1. 문제 링크 https://leetcode.com/problems/isomorphic-strings/ Isomorphic Strings - LeetCode Can you solve this real interview question? Isomorphic Strings - Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replace leetcode.com 2. 문제 설명 두 문자열 s와 t가 주어졌을 때, 두 문자열이 iso..
1. 문제 링크 LeetCode - The World's Leading Online Programming Learning Platform Next Permutation - LeetCode Can you solve this real interview question? Next Permutation - A permutation of an array of integers is an arrangement of its members into a sequence or linear order. * For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], leetcode.com 2. 문제 설명 주어진 수를 한 번씩 사용..
1. 문제 링크 LeetCode - The World's Leading Online Programming Learning Platform Divide Two Integers - LeetCode Can you solve this real interview question? Divide Two Integers - Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. The integer division should truncate toward zero, which means losing it leetcode.com 2. 문제 설명 정수의 나눗셈 후 소..
1. 문제 링크 https://leetcode.com/problems/remove-linked-list-elements/ Remove Linked List Elements - LeetCode Can you solve this real interview question? Remove Linked List Elements - Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head. Example 1: [https://assets.leetcode. leetcode.com 2. 문제 설명 연결 리스트 head와 va..
1. 문제 링크 https://leetcode.com/problems/happy-number/ Happy Number - LeetCode Can you solve this real interview question? Happy Number - Write an algorithm to determine if a number n is happy. A happy number is a number defined by the following process: * Starting with any positive integer, replace the number by the sum of the squar leetcode.com 2. 문제 설명 주어진 수가 happy 넘버인지 따져서 True, False 반환 여기서 h..
1. 문제 링크 Swap Nodes in Pairs - LeetCode Swap Nodes in Pairs - LeetCode Can you solve this real interview question? Swap Nodes in Pairs - Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be chan leetcode.com 2. 문제 설명 주어진 연결 리스트의 인접한 두 (홀수, 짝수) 노드를 서로 바꾸어 (짝수, 홀수)로 반환..
1. 문제 링크 https://leetcode.com/problems/generate-parentheses Generate Parentheses - LeetCode Can you solve this real interview question? Generate Parentheses - Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"] Exa leetcode.com 2. 문제 설명 주어진 n쌍의 괄호로, 올바르게 구성된 괄호의 모든 조..
1. 문제 링크 https://leetcode.com/problems/remove-nth-node-from-end-of-list/ Remove Nth Node From End of List - LeetCode Can you solve this real interview question? Remove Nth Node From End of List - Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: [https://assets.leetcode.com/uploads/2020/10/03/remove_ex1.jpg] leetcode.com 2. 문제 설명 연결 리스트..