
오늘 리뷰할 문제는 N queens이다. https://leetcode.com/problems/n-queens/description/ N-Queens - LeetCode Can you solve this real interview question? N-Queens - The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. You ma leetcode.com 문제를 가볍게 설명해보자면 체스에서 퀸은 수직, 수평, 그리..

오늘 리뷰할 문제는 wildcard matching이라는 문제이다. https://leetcode.com/problems/wildcard-matching/description/ Wildcard Matching - LeetCode Can you solve this real interview question? Wildcard Matching - Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*' where: * '?' Matches any single character. * '*' Matches any sequence of character leetcode.com ..

오늘 리뷰할 문제는 trapping rain water이다. https://leetcode.com/problems/trapping-rain-water/ Trapping Rain Water - LeetCode Can you solve this real interview question? Trapping Rain Water - Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: [https://assets.leetcode.com/upl leetcode.com 문제로 말로 설명하자면, 2..

오늘 리뷰할 문제는 first missing positive https://leetcode.com/problems/first-missing-positive/description/ First Missing Positive - LeetCode Can you solve this real interview question? First Missing Positive - Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses O(1) auxiliary space. Example 1: Inp leetcode.c..

오늘 리뷰할 문제는 37번 sudoku solver이다. https://leetcode.com/problems/sudoku-solver/description/ Sudoku Solver - LeetCode Can you solve this real interview question? Sudoku Solver - Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: 1. Each of the digits 1-9 must occur exactly once in each row. 2. Ea leetcode.com 스도쿠를 어려서부터 해온 ..

오늘 리뷰할 문제는 leetcode 32번 longest valida parentheses이다. https://leetcode.com/problems/longest-valid-parentheses/ Longest Valid Parentheses - LeetCode Can you solve this real interview question? Longest Valid Parentheses - Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Example 1: Input: s = "(()" Output: 2 Expla..

오늘 리뷰할 문제는 30번 substring with concatenation of all words이다. https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/ Substring with Concatenation of All Words - LeetCode Can you solve this real interview question? Substring with Concatenation of All Words - You are given a string s and an array of strings words. All the strings of words are of the same length. A conca..

오늘 리뷰할 문제는 reverse nodes in k group이다. https://leetcode.com/problems/reverse-nodes-in-k-group/description/ Reverse Nodes in k-Group - LeetCode Can you solve this real interview question? Reverse Nodes in k-Group - Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. k is a positive integer and is less than or equal to the length of the linked ..

오늘 리뷰할 문제는 merge k sorted list라는 문제이다. https://leetcode.com/problems/merge-k-sorted-lists/description/ k개의 정렬된 linked list를 정렬된 한개의 linked list를 만드는 문제. linked list로 되어 있는 것부터 다 순회한 다음 정렬하는것은 포기했다. 내가 한 접근은 어차피 다 정렬되어 있으니, 최대 사이즈가 k인 heap을 관리하여 list의 첫 아이템을 넣어두고, 뺄 때마다 해당 list의 다음 노드를 넣게 했다. from heapq import heappush, heappop from typing import Optional, List class ListNode: def __init__(self, ..

오늘 정리할 문제는 leetcode 알고리즘의 10번 문제 regular expression matching이라는 문제이다. https://leetcode.com/problems/regular-expression-matching/submissions/1105739483/ LeetCode - The World's Leading Online Programming Learning Platform 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 간략화된 pattern (특수기호는 2가지..
- Total
- Today
- Yesterday
- slay the spire에 진심인편
- datalakehouse
- leetcode
- 개발자 글쓰기
- maximum rectangle
- leetcode 매일풀기
- scramble string
- leetcode 매일 풀기
- longest valid parentheses
- permutation sequence
- sudoku solver
- 글또 10기
- valid number
- Python
- first missing positive
- best time to buy and sell stock 3
- substring with concatenation of all words
- word ladder 2
- otel
- hard mode challenge
- mlse
- binary tree maximum path sum
- n queens 2
- text justification
- 가상면접 사례로 배우는 대규모 시스템 설계
- 회고
- palindrome partitioning 2
- wildcard matching
- 알고리즘
- distinct subsequences
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |