๐ GenAI Explorer | ๐ ๏ธ Shipping in Public
Traded my Java boilerplate for LLM prompts.
๐ผ Seeking my next big challenge.
๐ป Coding daily (or dying trying)
Day 66 of #100DaysOfCode
Solved Fancy Sequence.
Key idea: treat operations as an affine transform x โ ax + b.
Used lazy updates with global mul and add, and modular inverse when appending.
Nice math + data structure trick ๐ฅ
#leetcode#coding
Day 64 & 65 of #100DaysOfCode
โข Day 64: Complement of Base 10 Integer โ simple bit mask + XOR trick.
โข Day 65: Graph problem with spanning tree stability using Binary Search + DSU.
#leetcode#coding
Day 62 & 63 of #100DaysOfCode
Solved two DP #POTDs on Stable Binary Arrays.
โข Yesterday: Stable Binary Arrays I
โข Today: Stable Binary Arrays II
Used DP with states tracking zeros/ones used and last element, subtracting cases that exceed the limit of consecutive bits.
Day 61 of #100DaysOfCode
Solved Find Unique Binary String.
Used Cantorโs diagonal idea: flip the i-th bit of the i-th string to construct a new binary string that must differ from every given one.
Simple and clever trick problem ๐
#leetcode#coding
Day 60 of #100DaysOfCode
Solved Minimum Number of Flips to Make the Binary String Alternating.
Key idea: rotations matter, so treat the string as circular (s + s) and use a sliding window to compare with 0101... and 1010....
Nice mix of sliding window + string logic ๐
#leetcode
Day 59 of #100DaysOfCode
Solved Check if Binary String Has at Most One Segment of Ones.
Idea: once a 0 appears after the first 1 segment, seeing another 1 means a second segment exists โ return False.
Simple scan, O(n) solution โ
#leetcode#coding
Day 58 of #100DaysOfCode
Solved Minimum Changes to Make Alternating Binary String.
Noticed there are only two valid patterns: 0101... and 1010....
Count mismatches for both and take the minimum.
Simple observation, clean O(n) solution โ
#leetcode#coding#buildinpublic
Day 57 of #100DaysOfCode
Solved Special Positions in a Binary Matrix.
Counted 1s in each row and column first, then checked cells where
mat[i][j] = 1 and both row & column counts are exactly 1.
Simple counting + matrix traversal โ
#leetcode#CodingJourney
Day 56 of #100DaysOfCode
Worked on Sudoku Solver today ๐งฉ
Started with basic backtracking, optimized it using row/column/box sets for O(1) checks.
Big difference in performance!
Nice reminder that pruning matters in recursion ๐ฅ
#coding#programming
Day 55 of #100DaysOfCode
Todayโs POTD: Partitioning Into Minimum Number of Deci-Binary Numbers ๐ข
Instead of memorizing the trick, I simulated the construction layer by layer.
Each pass subtracts 1 from non-zero digits.
Realized the answer equals the max digit.
#Coding#LeetCode
Day 54 of #100DaysOfCode
Todayโs POTD: Concatenation of Consecutive Binary Numbers
Instead of building a huge binary string, kept shifting the result left by bit length and adding current number.
Tracked bit growth at powers of two.
Bit manipulation + modulo trick โ
#leetcode
Day 53 of #100DaysOfCode
Tried todayโs Hard #POTD (Minimum Operations to Equalize Binary String) โ couldnโt crack it after multiple attempts. Tough parity + edge case problem.
Didnโt stop there though ๐ช
Solved โRemove Nth Node From Endโ instead using two pointers in one pass.
Day 51 & 52 of #100DaysOfCode
Yesterday forgot to post ๐
Solved:
โข Sort Integers by Number of 1 Bits โ custom sort by bit count
โข Reduce Binary to One โ right-to-left carry simulation
Bit manipulation streak continues ๐ฅ
#leetcode#coding
Day 50 of #100DaysOfCode
Todayโs POTD: Sum of Root to Leaf Binary Numbers ๐ณ
Use DFS, build number with (curr<<1)|val, add when reaching leaf.
Bit + Tree combo โ
#leetcode#coding
Day 49 of #100DaysOfCode
Solved todayโs POTD โ Check If a String Contains All Binary Codes of Size K โ
Idea: there are 2^k possible binary codes.
Slide a window of size k, track unique patterns, and verify count.
Nice mix of sliding window + bit thinking ๐ฅ
#leetcode#coding
Day 48 of #100DaysOfCode
Yesterday missed the POTD (Prime Number of Set Bits),
so solved it today along with todayโs POTD โ Binary Gap โ
Both were bit manipulation based problems.
Small questions, but good practice for thinking in bits.
#leetcode#coding#programming
Day 46/100 #100DaysOfCode
Pushed to 30 epochs on DeiT-tiny with IDRiD dataset (Indian DR grading).
Train Acc: ~85%
Val Acc: ~62% (after tweaks)
Models, curves & history saved locally. Momentum building! Next: Grad-CAM + fairness metrics ๐ฅ
#PyTorch#ComputerVision#MedicalAI