Day 83/100 π
Saturday, keeping it simple and focusing on maintaining the streak.
Worked on Number of 1 Bits today.
A little bit of bit manipulation practice as I continue with NeetCode 250.
17 days to go!
#100DaysOfCode
Day 82/100 π
Continuing with NeetCode 250.
Worked on:
β Non-overlapping Intervals
β Meeting Schedule
Getting more familiar with interval problems, especially sorting, overlap detection and greedy decisions.
18 days to go!
#100DaysOfCode
Day 81/100 π
Continuing with NeetCode 250.
Worked on Merge Intervals today.
Practising interval problems and getting more comfortable identifying overlaps and deciding when to merge.
19 days to go!
#100DaysOfCode
Day 80/100 π
Today:
β Worked on Insert New Interval
β Did a mock interview on https://t.co/am8zdJayec
The interview question involved finding the first False in a sorted boolean array using binary search.
80 days in. 20 to go!
#100DaysOfCode
Day 79/100 π
Continuing with NeetCode 250.
Worked on Serialize and Deserialize Binary Tree today.
Practising tree traversal and thinking about how to preserve the structure of a tree when converting it into a string and rebuilding it.
21 days to go!
#100DaysOfCode
Day 78/100 π
Continuing with NeetCode 250.
Worked on Binary Tree Maximum Path Sum today.
Practising tree DFS and understanding the difference between the path returned to a parent and the best path found anywhere in the tree.
22 days to go!
#100DaysOfCode
Day 77/100 π
Continuing with NeetCode 250.
Worked on Power of Three today.
Practising repeated division and checking how a number reduces down to 1.
23 days to go!
#100DaysOfCode
Day 76/100 π
Continuing with NeetCode 250.
Worked on Clone Graph today.
Practising graph traversal and using a hash map to keep track of cloned nodes, especially when dealing with cycles.
24 days to go!
#100DaysOfCode
Day 75/100 π
Three quarters of the way through!
Worked on Minimum Window with Characters today.
This one took multiple attempts. Still working on understanding sliding window problems and getting the logic right.
25 days to go!
#100DaysOfCode
Day 74/100 π
Worked on Construct Binary Tree from Preorder and Inorder Traversal today.
Practising recursion and understanding how preorder and inorder traversals work together to rebuild a binary tree.
#100DaysOfCode
Day 73/100 π
Revisited Merge K Sorted Lists today, focusing on improving time complexity.
Switched to pairwise merging using divide-and-conquer, bringing the time complexity down from O(N log N) to O(N log K).
Learning to optimise, not just solve.
#100DaysOfCode
Day 72/100 π
Continuing with NeetCode 250.
Worked on Majority Element today.
Practising array problems and learning how a simple candidate-and-count approach can find the majority element in linear time.
#100DaysOfCode
Day 71/100 π
Continuing with NeetCode 250.
Worked on:
β Longest Common Prefix
β Remove Element
Practising string comparisons and in-place array manipulation. Keeping the daily habit going, one problem at a time.
#100DaysOfCode
Day 70/100 π
70 days into the challenge!
Worked on Subsets today, practising backtracking and exploring the choices of including or excluding each element.
Still learning, still showing up.
#100DaysOfCode
Day 69/100 π
Worked on Binary Tree Diameter and Balanced Binary Tree today.
Both are labelled easy, but I still needed YouTube solutions to revise them.
A reminder that easy doesnβt always mean easy for me yet. Back to practising.
#100DaysOfCode
Day 68/100 π
Continuing with NeetCode 250.
Worked on:
β Sort Colors
β Sort an Array
Today was about sorting patterns, from in-place array partitioning to understanding efficient sorting algorithms.
#100DaysOfCode
Day 67/100 π
Continuing with NeetCode 250.
Worked on:
β Merge K Sorted Linked Lists
β Island Perimeter
Practising linked list merging and getting more comfortable with grid-based problems.
#100DaysOfCode