-
Learning Notes #40 – SAGA Pattern | Cloud Patterns
Category: UncategorizedToday, I learnt about SAGA Pattern, followed by Compensation Pattern, Orchestration Pattern, Choreography Pattern and Two Phase Commit. SAGA is a combination of all the above. In this blog, i jot down notes on SAGA, for my future self. Modern software applications often require the coordination of multiple distributed services to perform complex business…
-
Learning Notes #39 – Compensation Pattern | Cloud Pattern
Category: UncategorizedToday i learnt about compensation pattern, where it rollback a transactions when it face some failures. In this blog i jot down notes on compensating pattern and how it relates with SAGA pattern. Distributed systems often involve multiple services working together to perform a business operation. Ensuring data consistency and reliability across these services…
-
Learning Notes #38 – Choreography Pattern | Cloud Pattern
Category: UncategorizedToday i learnt about Choreography pattern, where each and every service is communicating using a messaging queue. In this blog, i jot down notes on choreography pattern for my future self. What is the Choreography Pattern? In the Choreography Pattern, services communicate directly with each other via asynchronous events, without a central controller. Each…
-
Learning Notes #37 – Orchestrator Pattern | Cloud Pattern
Category: UncategorizedToday, i learnt about orchestrator pattern, while l was learning about SAGA Pattern. It simplifies the coordination of these workflows, making the system more efficient and easier to manage. In this blog i jot down notes on Orchestrator Pattern for better understanding. What is the Orchestrator Pattern? The Orchestrator Pattern is a design strategy…
-
POTD #15 – Count all triplets with given sum in sorted array | Geeks For Geeks
Category: UncategorizedProblem Statement Geeks For Geeks : https://www.geeksforgeeks.org/problems/count-all-triplets-with-given-sum-in-sorted-array/1 Given a sorted array arr[] and a target value, the task is to count triplets (i, j, k) of valid indices, such that arr[i] + arr[j] + arr[k] = target and i < j < k. My Approach: Initially i tried to approach the problem, similar to this.…