December 05, 2022

🗒️ Problems Vowels of All Substrings - LeetCode Given a string word, return the sum of the number of vowels ('a', 'e', 'i', 'o', and 'u') in every substring of word. A substring is a contiguous (non-e…

November 23, 2022

One of the basic famous problem of Sudoku. And the advanced one is the Sudoku solver 🗒️ Problems Valid Sudoku - LeetCode Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be v…

November 16, 2022

🗒️ Problems Distinct Subsequences - LeetCode Given two strings s and t, return the number of distinct subsequences of s which equals t. The test cases are generated so that the answer fits on a 32-bit…

November 08, 2022

🗒️ Problems Construct Binary Tree from Preorder and Inorder Traversal - LeetCode Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is …

November 02, 2022

🗒️ Problems Lowest Common Ancestor of a Binary Tree - LeetCode Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedi…

October 24, 2022

🗒️ Problems Maximum Length of a Concatenated String with Unique Characters - LeetCode You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has …

October 21, 2022

🗒️ Problems Minimum Falling Path Sum - LeetCode Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first ro…

October 21, 2022

🗒️ Problems Maximum Score from Performing Multiplication Operations - LeetCode You are given two 0-indexed integer arrays nums and multipliers of size n and m respectively, where n >= m. You begin wit…

October 20, 2022

🗒️ Problems (1) Integer to Roman - LeetCode Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, 2 is written as II in Roman numeral, just two one's added to…

October 19, 2022

가장 먼저 생각난 솔루션은 backtrack 이지만 효율이 좋지 못하네요. knapsack을 이용한 dynamic programming 방법으로 푸는 방법이 있어서 정리해보았습니다. 🗒️ Problems Partition Equal Subset Sum - LeetCode Given a non-empty array nums containing only po…