Joined March 2026
- Tweets 693
- Following 152
- Followers 102
- Likes 1,396
130 Photos and videos
Pinned Tweet
Mar 31
Yesterday I wore an article on how my last week went
Its is posted on LinkedIn
linkedin.com/posts/ogochukwu…
1
7
195
DAY 35 - Stack with Max API
Started Chapter 9 today.
Built a Max API Stack using the brute force approach and revisited a core stack concept: FILO (First In, Last Out).
The implementation works, but getMax() exposes the bottleneck by scanning the entire stack every time.
1
Jun 13
DAY 34 - Cyclicity
Today I learned why Floyd's Slow/Fast Pointer algorithm feels like magic.
In one example, the pointers met exactly at the cycle start, which made me think the second traversal wasn't needed.
A second example proved me wrong.
1
Jun 12
DAY 33 - Detecting a Cycle in a Singly Linked List
Yesterday I used a list to track visited nodes.
Today I swapped it for a set and immediately improved lookup performance from O(n) to O(1) average time.
One lesson that clicked: nodes are unique objects, not just their values.
1
6
Jun 11
DAY 32 - Detecting Cycles in a Linked List
Today's video covers the brute-force solution.
It works, but there's a hidden cost: every node visit triggers another linear search through previously seen nodes.
A good reminder that a correct solution isn't always an efficient one.
1
4
CodeWithWho retweeted
Jun 10
Where are the wishful thinkers that are rumouring the exit of Engr Kwankwaso from the ticket??? Man is busy solidifying and smoothing ground while obi is busy with the public appearance and engagements. This ticket will be the most effective ticket to ever produced in Nigeria. It is possible!!!
Jun 10
I was deeply honoured to host a high-powered solidarity visit from the Igbo Elders Consultative Forum at my residence in Abuja.
The delegation was led by Dr. S. N. Okeke, Chairman of the Ohanaeze Council of Elders for the 19 States and the FCT, alongside former Governor of Enugu State, Okwesilieze Nwodo. The elders expressed strong appreciation for the growing and cordial partnership between myself and His Excellency Mr. Peter Obi under the Nigeria Democratic Congress (NDC). They pledged their unwavering support for the Obi/Kwankwaso ticket and assured the movement of massive electoral backing across the South-East and the wider Southern region.
In my response, I thanked the delegation for their visit and for the opportunity to exchange views on the state of the nation. Reflecting on the historic North-South East political dynamics, I expressed delight at the excellent and productive relationship I continue to enjoy with HE Peter Obi. I also reaffirmed my total commitment to the OK Movement and the National Democratic Congress (NDC), emphasising our resolute determination to deliver victory for the party in the upcoming elections. - RMK
1
1
74
Jun 10
DAY 31 - Understanding Cyclic Linked Lists
Before solving cycle detection, I wanted to understand what a cycle actually is.
Using Excalidraw, I walked through building a cyclic linked list and visualized how the tail points back to an earlier node instead of ending with null.
3
Jun 7
DAY 28 - Reviewing My Bubble Sort Mistakes
Yesterday's solution worked for my test case... and that was the problem.
Today I revisited it and found:
I misunderstood the complexity analysis.
My bubble sort wasn't actually a full bubble sort.
3
Jun 6
DAY 27 - Merge Two Sorted Lists
Finished the recursion section and jumped back into linked lists.
Before touching actual linked lists, I solved Merge Two Sorted Lists using normal Python lists first to strengthen my understanding of the problem, edge cases, and sorting logic.
5
Jun 5
DAY 26 - Recursive Traversal of Nested Lists
A nested list finally made recursion click for me.
The moment I saw that a list can contain a smaller version of itself, the solution became much clearer.
4
Jun 4
DAY 25 - Find the Maximum in a list - Part 2
Yesterday's solution worked.
Today's version uses the same O(n) time and O(n) space complexity, but with cleaner recursive thinking.
1
1
9
Jun 3
DAY 24 - Find Highest Number in a List
I used recursion to build an iteration system without a loop.
The biggest lesson wasn't finding the max value—it was understanding how values travel through the recursion stack and why forgetting a return breaks everything.
Video below
1
1
3
Jun 2
DAY 23 - Factorial Using Recursion
I used a simple factorial problem to strengthen my recursion thinking.
Seeing the recursion tree unfold made it much easier to understand why the solution works and why the space complexity is O(n).
#EPI #Algorithms
2
Jun 1
DAY 22 - Recursive Summation of an Array
I thought my recursive summation solution was already good... until I realized slicing was creating a new array every call.
Today's lesson:
Reduce the problem logically, not physically.
Video shows the optimization.
1
May 31
DAY 21 - Recursive Array Summation
I thought this was a simple O(n) recursion problem.
Then I remembered slicing isn't free.
The recursion tree looks linear, but every arr[1:] creates a new array, turning the solution into O(n²).
Today's video is more about costs in recursion
3
May 30
1. X Caption
DAY 20 - Recursive Palindrome Check
Sometimes the hardest part of recursion isn't writing it.
It's visualizing what each recursive call is actually doing.
Today's EPI problem: checking if a string is a palindrome using recursion.
3
May 28
DAY 18 - Maze Traversal / DFS Pathfinding (Part 2)
Finally implemented the recursion.
The hardest part?
Visualizing how one recursive call can branch into 4 directions while backtracking keeps the search clean.
Also finally understood why visited should be a set 👀
2
May 26
DAY 16 - Generate Valid Parentheses
Backtracking isn’t just “try everything”.
Its structure.
You build a recursion tree where every call already knows the rules for valid output.
Open → Close is not random… It’s controlled flow.
1
May 25
DAY 15 - Optimized Fibonacci (Memoization)
Yesterday recursion looked clean.
Today I watched one small cache turn “this never stops running” into a result for fibonacci(100).
Same recursion.
Way less repeated work.
That was the real lesson.
1
May 24
DAY 14 - Fibonacci Sequence (Brute Force Recursion)
Today’s EPI practice looked simple… until fibonacci(100) reminded me recursion is not free 😭
Built Fibonacci using brute force recursion and saw how repeated work makes performance explode.
The code works. The scale doesn’t
1
May 23
DAY 13 - Generate All Permutations
Want to see how a small tweak speeds up permutation generation? In today’s video, we optimize backtracking by reducing search time to O(1). Check it out!
3