Home
Metalog
Cancel

2357. Make Array Zero by Subtracting Equal Amounts

2357. Make Array Zero by Subtracting Equal Amounts Problem & Example Questions before reading example 나의 풀이 time complexity : O(n^2) space complexity : O(1) 다른 풀이 (SIMPLE, EASY-UNDERSTANDIN...

323. Number of Connected Components in an Undirected Graph

323. Number of Connected Components in an Undirected Graph Problem & Example Questions before reading example 나의 풀이 time complexity : O(E+V) (E=Number of edges, V=Number of vertices) space ...

LeetCode 1165. Single-Row Keyboard

1165. Single-Row Keyboard Problem & Example Questions before reading example 나의 풀이 time complexity : O(n) space complexity : O(1) Spent time 8m Review String 의 indexOf 만 알면 쉽게 풀 수 있는...

LeetCode 1198. Find Smallest Common Element in All Rows

1198. Find Smallest Common Element in All Rows Problem & Example Questions before reading example 나의 풀이 time complexity : O(m * n) space complexity : O(n) Count Elements 풀이 time complexity ...

LeetCode 832. Flipping An Image

832. Flipping An Image Problem & Example Questions before reading example 나의 풀이 Spent time 10m Review 단순하게 문제에 나와있는 아이디어 그대로 풀면 풀리겠지..? 싶었는데 다행히 잘 풀렸다.

LeetCode 797. All Paths From Source to Target

797. All Paths From Source to Target Problem & Example Questions before reading example 나의 풀이 Spent time 30m Review dfs, backtracking 와 친해지는중.. index 를 알맞게 잘 활용하는 것(target 과 lengt...

LeetCode 21. Merge Two Sorted Lists

21. Merge Two Sorted Lists Problem & Example Questions before reading example 나의 풀이 Spent time 30m Review 진짜 쉽고 간단한 문제였는데.. handler 라는 아이디어를 내지 못해서 오래걸렸다.

LeetCode 9. Palindrome Number

9. Palindrome Number Problem & Example Questions before reading example 나의 풀이 Spent time 5m Review 예전에 분명히 풀어보았던 팰린드롬의 수 문제 함정이 있을까 조마조마하며 풀었는데 다행히 한번에 잘 풀렸다.

LeetCode 48. Group Anagrams

48. Group Anagrams Problem Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters o...

LeetCode 258. Add Digits

258. Add Digits Problem Given an integer num, repeatedly add all its digits until the result has only one digit, and return it. Questions before reading example Example Input: num = 38 Outpu...