Abhinav Anand

Actively looking for tech jobs
🎓Grad _BTech (CSE '24) and a Software Engineer
🖥️ Competitive Coder || Full Stack Developer

[Abhinav Anand @abhinav0918]

Day 60/90
Huge session—solved 5 DP on strings problems after work!

Min Insertions for Palindrome
Min Operations to Convert A to B
Shortest Common Supersequence
Distinct Subsequences
Edit Distance

Saving Wildcard Matching for tomorrow to avoid burnout
#LeetCode #SWE #TechTwitter

[Abhinav Anand @abhinav0918]

Day 61/90

Sticking with DP is paying off! Started DP on Strings:

Longest Common Subsequence (LCS)
Print LCS (table backtracking)
Longest Common Substring (reset streak)
Longest Palindromic Subsequence (reverse + LCS)

On to Day 60!
#DSA #LeetCode #100DaysOfCode #TechTwitter #AI

[Abhinav Anand @abhinav0918]

Day 61/90
Finished DP on subsequences today!

Solved:
Target Sum (neat reduction to subset diff)
Coin Change II (counting total ways)
0/1 & Unbounded Knapsack
Rod Cutting

Confidence is back—recurrence relations feel natural now. DP on Strings starts tomorrow!
#DSA #LeetCode #AI

[Abhinav Anand @abhinav0918]

@Gosleepriya 9116 🙂

[Abhinav Anand @abhinav0918]

Day 62/90
Back in the zone! Tackled 3 DP problems on subsequences:

Count Subsets with Sum K
Count Partitions with Difference (clean math reduction to target sum)
Coin Change (unbounded knapsack)

Wrapping up subsequences. Consistently building interview intuition!
#DSA #LeetCode

[Abhinav Anand @abhinav0918]

Day 64/90

Hit a motivation slump, but kept the streak alive with subset DP problems!

Subset Sum = Target (pick/no-pick)

Partition Equal Subset Sum (target = total/2)

Struggled with min sum difference, but pushing forward. Prepping for top tech SWE roles!

#DSA #LeetCode #grok

[Abhinav Anand @abhinav0918]

Day 65/90
Procrastinated all day, but kept the streak alive with 2 DP problems!

Minimum Falling Path Sum (10-min tabulation)
Cherry Pickup II (compressed 4D states to 3D DP)

Bottom-up tabulation is finally clicking. Prepping for global SWE roles!

#DSA #DynamicProgramming #Code

[Abhinav Anand @abhinav0918]

Day 66/90
Grid DP made 2D tabulation click today!
Solved 4 problems:

Unique Paths I & II
Minimum Path Sum in Grid
Triangle (bottom-up is so clean)

Recursion, memoization & tabulation felt solid. Working toward tech SWE roles

#DSA #DynamicProgramming #LeetCode #SoftwareEngineer

[Abhinav Anand @abhinav0918]

Day 67/90

Solved House Robber I & II across all 4 ways (recursion to space optimization).

Then 2D DP hit: Geek’s Training humbled me. Memoization was fine, but 2D tabulation took 1.5 hours and broke my brain. Taking it one step at a time!

On to Day 66!

#DSA #100DaysOfCode #AI

[Abhinav Anand @abhinav0918]

Day 68/90

Travel yesterday was exhausting, but I still solved 2 DP problems today: Frog Jump and Frog Jump with K Distance.

Writing recursion and memoization feels natural, but tabulation and space optimization still slow me down a bit.

On to Day 67!

#DSA #100DaysOfCode #SDE2

[Abhinav Anand @abhinav0918]

Day 69/90

Revised BSTs and Linked Lists, then officially kicked off Dynamic Programming!

Solved Fibonacci across all 4 forms (recursion, memo, tabulation, O(1) space) and did Climbing Stairs.

Diving deeper into 1D DP tomorrow!

#DSA #100DaysofCode #AI #Grok #DP #SDE2 #Abroad

[Abhinav Anand @abhinav0918]

Day 70/90

Finished linked lists!

Tackled Clone LL with Random Pointer and Flattening a Linked List.

Interweaving nodes for O(1) space on Clone and merging backwards recursively for Flattening were neat patterns. Revising BSTs tonight, DP starts tomorrow!

#DSA #100daysOfCode

[Abhinav Anand @abhinav0918]

Day 71/90

Moved to Doubly Linked Lists today!

Solved 4 problems:

1) Reverse DLL

2) Delete all occurrences of a key

3) Pairs with given sum (clean two pointers using head & tail)

4) Remove duplicates

DLL feels so much easier with prev pointers. DP next!

#DSA #100DaysofCode

[Abhinav Anand @abhinav0918]

Day 72/90

Solved 4 linked list problems:

Sort 0s, 1s, 2s (3 dummy lists)

Intersection node (length difference offset)

Add 1 (tracking last non-9 digit is genius)

Add 2 Numbers

Done with singly LL, starting Doubly LL tomorrow!

#DSA #100DaysofCode #AI #Grok #Software #Engg

[Abhinav Anand @abhinav0918]

Day 73/90
Solved 4 linked list problems today:

Odd Even List
Remove Nth node from end (1-pass fast/slow gap trick)
Delete middle node
Sort List (merge sort on linked list)

Linked lists are finally feeling smooth!

#DSA #Grok #100DaysofCode #Sde2 #Abroad #Singapore #AI #Grind

[Abhinav Anand @abhinav0918]

Day 74/90

Kept the streak alive before traveling!

Covered cycle problems in linked lists: detect loop, find loop start, and loop length using slow & fast pointers. Also solved Palindrome Linked List.

Grinding from home starting tomorrow!

#DSA #100DaysofCode #SDE2 #Abroad #ai

[Abhinav Anand @abhinav0918]

Day 75/90

Solved 4 linked list questions: deletion, length, search, and reverse.

Did iterative and recursive for all. Tree habits made recursive reverse tricky, but Striver’s video helped. Traveling tomorrow, will try to keep the streak!

#DSA #Coding #AI #Grok #100daysofcode

[Abhinav Anand @abhinav0918]

Day 76/90
Revised binary trees today and started linked lists!

Got totally stuck on LeetCode's "Delete Node in a Linked List" because no head pointer is given. Turns out it’s just 2 lines: copy the next node's value and bypass it.

BST revision + linked lists tomorrow.

#DSA #AI

[Abhinav Anand @abhinav0918]

Day 77/90

Dealt with some family stress today, but kept the streak alive with 2 good problems:

Recover BST (solved using recursive inorder pointers; will revisit iterative Morris)
Largest BST (used postorder + struct to pass subtree info)

On to Day 76!

#DSA #100DaysOfCode #AI

[Abhinav Anand @abhinav0918]

Day 78/90

Solved Inorder Successor, Merge 2 BSTs, BST Iterator, and Two Sum in BST.

Solving Two Sum in O(H) space by running two BST iterators (forward + reverse) as two pointers blew my mind. Never would have thought of that without a video.

Wrapping up trees soon!
#DSA #Grok