notes from shu·Sep 27LeetCode Diaries #18: Big Girl Pants, Big O NotationSomebody give me a gold star please.
EverythingGuy·Sep 16LeetCode 2472: Maximum Number of Non-overlapping Palindrome Substrings : My Intution and ideasProblem in Simple Words
EverythingGuy·Sep 13LeetCode 3414: Maximum Score of Non-overlapping Intervals : My Intution, Idea and SolutionThis problem looks like a normal interval problem at first, but there are three things happening at once:
EverythingGuy·Sep 7Stop Counting the Same Subsequence Twice: Solving LeetCode 940 with MemoizationLeetCode 940, Distinct Subsequences II, looks like a normal subsequence problem at first.
Jao Thomas·Sep 7940. Distinct Subsequences IIGiven a string s, return the number of distinct non-empty subsequences of s. Since the answer may be very large, return it modulo 10^9 + 7.
EverythingGuy·Aug 24Stone Game VIII: The Hard DP That Became One Right-to-Left Scan ( Leetcode 1872 )Stone Game VIII initially looks complicated because Alice and Bob repeatedly merge stones, accumulate scores, and make optimal decisions…
Shagunmohta·Aug 22[LC 4]: Median of Two Sorted ArraysAt first, this problem looks almost too easy. So why on earth is this a LeetCode Hard? Let’s understand the problem statement first..A response icon2A response icon2
Jao Thomas·Jul 303518. Smallest Palindromic Rearrangement IIYou are given a palindromic string s and an integer k.
