Category: Road to Google

This time, let’s try Doubly Linked Lists which may sound a little challenging when compared to the last ones, but it’s actually not that much. … Continue Reading >Road to Google – Part 10: Doubly Linked Lists

This is a little more advanced version fo the previously featured linked list. This time, you have to reverse the specific letters and return the new list. … Continue Reading >Road to Google – Part 9: M, N Reversals

If you have ever learned C’s pointer mechanisms, you’ll be able to understand it without any trouble. A linked list is all about how you can take advantage of the pointer’s concept, regardless of what language you prefer. … Continue Reading >Road to Google – Part 8: Linked Lists

Okay, so this is going to be a little advanced version of the previously featured Palindrome question. Let’s step further one more time. … Continue Reading >Road to Google – Part 7: Almost a Palindrome

Here’s an intro to Palindrome. Since this technique is quite useful when solving not only coding challenges but also real-world problems, it’s great timing to learn about it. … Continue Reading >Road to Google – Part 6: Palindrome

It has been a little while since I last updated my blog. But my coding and tech journey never stops, and I’ll keep searching for every possibility I can think of to grow not only as a programmer but also as a person. … Continue Reading >Road to Google – Part 5 Longest Substring Without Repeating Characters: Brute Force and Optimal Solution

Since I need to work on improving my coding skill, now that my ‘Road to Google’ is unstoppable! Keep coding, keep improving your skills, and keep growing together! You’re not alone! … Continue Reading >Road to Google – Part 4 Typed Out Strings Ⅱ: Optimal Solution

This time, we’re going to take a look at Typed Out Strings challenge. Let’s see how we can take advantage of what we learned so far! … Continue Reading >Road to Google – Part 4 Typed Out Strings Ⅰ: Brute Force