[CS fundamentals] Greedy - Dijkstra, Kruskal and Prim's AlgorithmThink about how Google Maps finds the shortest path from your home to your favorite restaurant. Each traffic light might represent a vertex of a graph6 min read·jaylog.hashnode.devJul 22
[CS fundamentals] Linked List Creation & Insertion explained in C. In this article, we will look at fundamentals of linked lists. Linked list is a really powerful data structure8 min read·jaylog.hashnode.devMay 18
[CS Fundamentals] Pointers in CIn this article, I will be talking about pointers in C. Pointers might be a bit hard concept for beginners, but they are essential to understand what5 min read·jaylog.hashnode.devMar 25
[SQL] Writing Efficient SQL QueriesThink of yourself building a program. It can be any types, such as website, app, etc. These applications may require database to show the data that the user4 min read·jaylog.hashnode.devJun 30, 2025
[CS Fundamentals] Binary SearchBinary Search is a powerful algorithm to search for a certain value. If you were to find 3 in an array = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], how are you going t3 min read·jaylog.hashnode.devMay 19, 2025
