LeetCodeRecord

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

오답노트

1770. Maximum Score from Performing Multiplication Operations

처음에 3차원 DP 배열을 사용했는데, 메모리 초과가 발생했다. 크기가 크다보니 미리 예상하긴 했지만 다른 방법이 생각나지 않아서 결국 제출했던건데 역시는 역시나였다..
```
dp[startIdx][endIdx][i]
```
다시 곰곰히 생각해보니 nums[]의 끝이나 앞에서만 숫자를 제거할 수 있고, i 값으로 그동안 몇개의 숫자가 제거되었는지 알 수 있다.

따라서 다음의 식이 성립한다는걸 깨달았고, startIdx만 저장해서 푸는 식으로 해결을 했다.
```
endIdx = (nums.length - 1) - (i - startIdx)
```
그리고 nums[]에 숫자가 하나만 있을 경우, 값을 바로 리턴할 수 있도록 로직을 작성했는데 nums[startIdx] * mulipliers[i]가 아닌 nums[startIdx]만 리턴해주도록 구현 실수를 해서 한번 틀렸다.

아마 오답 테스트케이스를 볼 수 없었다면 해결하는데 시간이 꽤 걸렸을 것 같다.

336. Palindrome Pairs

Trie 자료 구조를 모르는 상태로 풀다가 도저히 시간초과를 해결할 수가 없어서 풀이를 참고해서 해결했다.

https://leetcode.com/problems/palindrome-pairs/discuss/79195/O(n-*-k2)-java-solution-with-Trie-structure

Name		Name	Last commit message	Last commit date
Latest commit History 403 Commits
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0012-integer-to-roman		0012-integer-to-roman
0020-valid-parentheses		0020-valid-parentheses
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0036-valid-sudoku		0036-valid-sudoku
0038-count-and-say		0038-count-and-say
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0076-minimum-window-substring		0076-minimum-window-substring
0079-word-search		0079-word-search
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0212-word-search-ii		0212-word-search-ii
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0223-rectangle-area		0223-rectangle-area
0224-basic-calculator		0224-basic-calculator
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0263-ugly-number		0263-ugly-number
0264-ugly-number-ii		0264-ugly-number-ii
0279-perfect-squares		0279-perfect-squares
0295-find-median-from-data-stream		0295-find-median-from-data-stream
0334-increasing-triplet-subsequence		0334-increasing-triplet-subsequence
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0374-guess-number-higher-or-lower		0374-guess-number-higher-or-lower
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0433-minimum-genetic-mutation		0433-minimum-genetic-mutation
0446-arithmetic-slices-ii-subsequence		0446-arithmetic-slices-ii-subsequence
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0587-erect-the-fence		0587-erect-the-fence
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0766-toeplitz-matrix		0766-toeplitz-matrix
0835-image-overlap		0835-image-overlap
0899-orderly-queue		0899-orderly-queue
0901-online-stock-span		0901-online-stock-span
0907-sum-of-subarray-minimums		0907-sum-of-subarray-minimums
0947-most-stones-removed-with-same-row-or-column		0947-most-stones-removed-with-same-row-or-column
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
112-path-sum		112-path-sum
113-path-sum-ii		113-path-sum-ii
1155-number-of-dice-rolls-with-target-sum		1155-number-of-dice-rolls-with-target-sum
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1235-maximum-profit-in-job-scheduling		1235-maximum-profit-in-job-scheduling
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1293-shortest-path-in-a-grid-with-obstacles-elimination		1293-shortest-path-in-a-grid-with-obstacles-elimination
1323-maximum-69-number		1323-maximum-69-number
1328-break-a-palindrome		1328-break-a-palindrome
1335-minimum-difficulty-of-a-job-schedule		1335-minimum-difficulty-of-a-job-schedule
1457-pseudo-palindromic-paths-in-a-binary-tree		1457-pseudo-palindromic-paths-in-a-binary-tree
1531-string-compression-ii		1531-string-compression-ii
1544-make-the-string-great		1544-make-the-string-great
1578-minimum-time-to-make-rope-colorful		1578-minimum-time-to-make-rope-colorful
16-3sum-closest		16-3sum-closest
1657-determine-if-two-strings-are-close		1657-determine-if-two-strings-are-close
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent
1680-concatenation-of-consecutive-binary-numbers		1680-concatenation-of-consecutive-binary-numbers
1704-determine-if-string-halves-are-alike		1704-determine-if-string-halves-are-alike
1706-where-will-the-ball-fall		1706-where-will-the-ball-fall
1770-maximum-score-from-performing-multiplication-operations		1770-maximum-score-from-performing-multiplication-operations
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
1926-nearest-exit-from-entrance-in-maze		1926-nearest-exit-from-entrance-in-maze
1995-count-special-quadruplets		1995-count-special-quadruplets
2007-find-original-array-from-doubled-array		2007-find-original-array-from-doubled-array
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
2131-longest-palindrome-by-concatenating-two-letter-words		2131-longest-palindrome-by-concatenating-two-letter-words
2136-earliest-possible-day-of-full-bloom		2136-earliest-possible-day-of-full-bloom
218-the-skyline-problem		218-the-skyline-problem
2225-find-players-with-zero-or-one-losses		2225-find-players-with-zero-or-one-losses
336-palindrome-pairs		336-palindrome-pairs
42-Trapping-Rain-Water		42-Trapping-Rain-Water
557-reverse-words-in-a-string-iii		557-reverse-words-in-a-string-iii
609-find-duplicate-file-in-system		609-find-duplicate-file-in-system
622-design-circular-queue		622-design-circular-queue
623-add-one-row-to-tree		623-add-one-row-to-tree
653-two-sum-iv-input-is-a-bst		653-two-sum-iv-input-is-a-bst
658-find-k-closest-elements		658-find-k-closest-elements
718-maximum-length-of-repeated-subarray		718-maximum-length-of-repeated-subarray
732-my-calendar-iii		732-my-calendar-iii
838-push-dominoes		838-push-dominoes
91-decode-ways		91-decode-ways
981-time-based-key-value-store		981-time-based-key-value-store
985-sum-of-even-numbers-after-queries		985-sum-of-even-numbers-after-queries
990-satisfiability-of-equality-equations		990-satisfiability-of-equality-equations
README.md		README.md

chisanahn/LeetCodeRecord

Folders and files

Latest commit

History