Day 24: DSA : DP Subsequences Medium - 2

Vacation Day 23/60 💻 Summary of Day 23 🚀 Today’s Progress: ✅ Solved a LeetCode problem • Number of Matching Subsequences The progress may be slow, but it's definitely moving forward #coding #DSA #leetcode #Java #ProblemSolving #buildinpublic

By greedily removing such removable steps, we isolate a core subsequence of reasoning steps that are labeled as important (as a sidenote, these core subsequences often include less than 15% of the entire CoT).

Almost everywhere divergence of Cesaro means of subsequences of Walsh–Paley Fourier partial sums Istvan Blahota, Gyorgy Gat arxiv.org/abs/2606.13879 [𝚖𝚊𝚝𝚑.𝙲𝙰]

Almost everywhere divergence of Cesaro means of subsequences of Wals... arXiv:2606.13879 A remark on Chebyshev rational functions, multipoint Pad\'e approxim... arXiv:2606.13965 l^{p}-L^{q} boundedness of sequence-to-function Hardy-Littlewood-P\'... arXiv:2606.13976

for more context here is what a doc looks like, instruction says to preserve the original regions exactly incl typos, and ONLY generate guesses for the [...] absent regions i use gemma4 12b's NTP entropy as a proxy for where to truncate (most predictable subsequences)

building on a "interleaved FITM for natural english" concept where the truncated subsequences are specifically the lower entropy regions of DCLM data (according to ntp distributions of a gemma) annoyingly preserving typos on purpose is hard even if TOLD to

String DP pattern: f(i, j) If s[i] == t[j]: → Move both pointers Else: → Skip from one side LCS, Edit Distance, Distinct Subsequences, etc. all build on this idea.

Since I was struggling with subsequences and subarrays with bit manipulation, I started solving some more bit manipulation problems. Let's see, if I can again pick up subsequences after solving these.

Day 7/60 DSA: • Strings: Second Most Repeated String, All Subsequences of a String • Searching & Sorting: 4 Sum, Missing and Repeating Number JavaScript: • Practice • Minor Project #BuildingInPublic #LetsConnect

To explain this generalization, we show that Vermeer attends to known localization subsequences, such as the Nuclear Localization Signal which mediates protein translocation into the nucleus. (3/n)

🔥 #Day 230 of my #DSA Journey! 🧩 Dynamic Programming 💻 Today's Problem is: ✅ Number of Longest Increasing Subsequences #LeetCode #DSA #365Days #BuildInPublic #cpp #ProblemSolving #Consistency #CodingJourney #LearnDSA

DAY 18/100: 72. Edit Distance-> for MIN(insert(i same,j-1) , delete(i-1,j same) , replace(i-1,j-1) (as ofc same hogya)) 115. Distinct Subsequences-> if same ->either i-1,j same or( ) i-1,j-1 if diff -> i-1 and j ko mat hilao jab tka same na mile

Base of Advance Recursion - print all subsequences - find all subsequences sum K - check if there exist subsequences sum K - count all subsequences This are most Common pattern which are going to be use in 70% Recursion Problems #LearningInPublic #DataScience #dsa #ml

Did some DSA after a nice break Today I did 2 problems on DP on subsequences 1. Subsequence sum equals k 2. Partition Equal Subset Sum I also revisited two of the hardest problems I've done in a while 1. Cherry pickup 2. Cherry pickup II

Today's Log: - Solved Day 4 of #SDESheetChallenge x.com/MishraSatyam183/status… - Revised DP on grids and subsequences - Solved 9 SQL problems on LeetCode

Sullyoon - Bolzano-Weierstrass Theorem Sullyoon has different personalities, like cute Yoona and General Sull. For the BW theorem, subsequences can converge to dif limits contained under the bounded parent seq, just like the different parts of Seol Yoona converge under Sullyoon!

yeah the good old days when all the employers wanted from programmers was Maximum Product of Subsequences With an Alternating Sum Equal to K written in 68k assembly those were the days! ahhhhh