Algorithms and Data Structures
30 articles
Algorithms and Data Structures - Queue
Learn how the Queue (FIFO) data structure works. Covers enqueue and dequeue operations, time complexity compared to stacks, and a Go implementation.
Algorithms and Data Structures - Stack
Learn how the Stack (LIFO) data structure works. Covers push, pop, and peek operations with time complexity analysis, and a complete Go implementation using slices.
Algorithms and Data Structures - Arrays
Understand arrays as a data structure: O(1) random access, O(n) insertion/deletion, static vs. dynamic memory allocation. Includes a Go array implementation.
Algorithms and Data Structures - Lists
Learn how singly linked lists work: O(n) access vs. O(1) insertion/deletion, pointer-based node traversal, and a Go implementation of a linear linked list.
Implementing a Trie in Golang
Learn how Trie (prefix tree) data structures work: O(m) search and insertion, applications in HTTP routing and IP lookups, and a Go implementation of insert and search operations.
Creating URL Routing Episode 3 (Final Episode)
Build PHP URL routing systems with path parameters, HTTP methods, tree-based search algorithms, and complete endpoint handling.
Creating URL Routing Episode 2
Implement optimized URL routing with refined tree structure patterns, endpoint mapping, and scalable web application routing logic.
Creating URL Routing Episode 1
Master URL routing using tree structures for HTTP request matching, path parameters, and efficient web application request handling.
Starting Algorithms with JavaScript
Master fundamental JavaScript algorithms including linear and binary search, plus selection and bubble sort implementations.
Order Notation and How to Determine Algorithm Complexity
An overview of the basics of calculating algorithm performance using Big O notation and complexity.