Today, i learnt about Expand Contract Pattern from Raul Junco on a linkedin post. This pattern is particularly useful during system migrations, feature rollouts, or refactoring of large systems. It ensures that new functionality can coexist with existing functionality temporarily, allowing for seamless transitions and safe rollbacks if needed. In this blog, i jot…

Problem Statement: Geeks For Geeks : https://www.geeksforgeeks.org/problems/pair-with-given-sum-in-a-sorted-array4940/1 You are given an integer target and an array arr[]. You have to find number of pairs in arr[] which sums up to target. It is given that the elements of the arr[] are in sorted order.Note: pairs should have elements of distinct indexes.  My Approach

Today, i read this paper on cache eviction. Didn’t came directly to this paper, but referred from SIEVE is Simpler than LRU. In this blog, i jot down bullet points that i understood from this paper for future reference. Historical Context Numerous innovations have focused on improving LRU’s miss ratio and throughput to make…

Today, i dive deeeeep in to backpressure handling. This is a continuation of How AWS Solves Backlog Queue ? . Backpressure is one of the mechanism to precaution to handle a backlog queue from occuring. In this blog i jot down notes on backpressure for my futureself. What is Backpressure? Backpressure occurs when a…

Problem Statement Geeks For Geeks : https://www.geeksforgeeks.org/problems/pair-in-array-whose-sum-is-closest-to-x1124/1 Given an array arr[] and a number target, find a pair of elements (a, b) in arr[], where a<=b whose sum is closest to target.Note: Return the pair in sorted order and if there are multiple such pairs return the pair with maximum absolute difference. If no such pair…