PinnedDesigning Web APIs: Chapter 5 - Design In PracticeNow that we’ve covered API paradigms, security, and best practices, it’s time to put these concepts into action. This chapter focuses on designing APIs through a hands-on approach using an imaginary example, emphasizing user-focused design and practi...Nov 22, 2024·14 min read·7.8K
Designing Web APIs: Chapter 2 - API ParadigmsChoosing the right API style is important for future success. It sets how a service shares data with other applications. Some companies don't plan enough for future updates, making it hard to change the API once it's in use by other developers. To av...Oct 11, 2024·11 min read·872
Designing Web APIs: Chapter 1 - What's an API?Overview Let’s get back to the chapter title “What’s an API?” As we know, it’s an application programming interface. However, APIs are so much more than their name suggests, and to understand what they really are, we must focus on the keyword interfa...Oct 5, 2024·4 min read·1.4K
A SQL Approach for Identifying High-Spending CustomersIn many businesses, understanding customer spending patterns can provide valuable insights into consumer behavior. Imagine a company that tracks customer orders and their total spending. Our task is to identify customers who have spent more than the ...Apr 12, 2023·3 min read·68
24. Swap Nodes in PairsProblem Statement 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 the nodes themselves may be changed). Example: codeInput: head = [1,2,3,...Sep 14, 2022·3 min read·34
3. Longest Substring Without Repeating CharactersProblem Statement: Given a string s, find the length of the longest substring without repeating characters. Examples: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. codeInput: s = "bbbbb" Output: 1 Explanatio...Aug 9, 2022·3 min read·17
113. Path Sum IIProblem Statement Given a binary tree and a target sum, find all root-to-leaf paths where the sum of the node values in the path equals the target sum. Each path should be represented as a list of integers from the root to the leaf. Example: codeInpu...Apr 20, 2022·3 min read·17
