DDIA Reading Notes - Chapter 3
Storage and Retrieval
Jessie Yu's Blog
Passionate Software Engineer | Crafting Code for Innovative Solutions | Problem Solver & Tech Enthusiast
Latest articles
DDIA Reading Notes - Chapter 2
Chapter Overview In chapter 2 of the book "Designing Data-Intensive Applications", the author Martin Kleppmann dives deep into the concepts of data models and query languages. Kleppmann mainly compares three prominent data models: the relational mode...
DDIA Reading Notes - Chapter 1
Maintainablity, Scalablity, Observerbility
Leetcode 242. Valid Anagram
Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: In...
Leetcode 142. Linked List Cycle II
Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Inte...
Leetcode 19 Remove Nth Node From End of List
Given the head of a linked list, remove the n<sup>th</sup> node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Example 2: Input: head = [1], n = 1 Output: [] Example 3: Input: head = [1,...
Leetcode 24 Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.) Example 1: Input: head = [1,2,3,4] Output: [2,1,4,3] E...
Leetcode 206. Reverse Linked List
Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input: head = [1,2] Output: [2,1] Example 3: Input: head = [] Output: [] Constraints: Th...
Leetcode 203 Remove Linked List Elements
A useful tool: sentinel node
