-
Learning Notes #8 – SLI, SLA, SLO
Category: UncategorizedIn this blog, i write about SLI, SLA, SLO . I got a refreshing session from a podcast https://open.spotify.com/episode/2Ags7x1WrxaFLRd3KBU50K?si=vbYtW_YVQpOi8HwT9AOM1g. This blog is about that. In the world of service reliability and performance, the terms SLO, SLA, and SLI are often used interchangeably but have distinct meanings. This blog explains these terms in detail, their…
-
POTD #5 – Set Matrix Zeroes | Geeks For Geeks
Category: UncategorizedProblem Statement Geeks For Geeks : https://www.geeksforgeeks.org/problems/set-matrix-zeroes/1 You are given a 2D matrix mat[][] of size n×m. The task is to modify the matrix such that if mat[i][j] is 0, all the elements in the i-th row and j-th column are set to 0 and do it in constant space complexity. My Approach
-
Learning Notes #7 – AMQP Protocol and RabbitMQ | An Overview
Category: UncategorizedToday, i learned about AMQP Protocol, Components of RabbitMQ (Connections, Channels, Queues, Exchanges, Bindings and Different Types of Exchanges, Acknowledgement and Publisher Confirmation). I learned these all from CloudAMQP In this blog, you will find a crisp details on these topics. 1. Overview of AMQP Protocol 2. How AMQP Works in RabbitMQ 3. Connections…
-
POTD #4 – Search in a sorted Matrix | Geeks For Geeks
Category: UncategorizedProblem Statement Geeks For Geeks – https://www.geeksforgeeks.org/problems/search-in-a-matrix-1587115621/1 Given a strictly sorted 2D matrix mat[][] of size n x m anda number x. Find whether the number x is present in the matrix or not. Note: In a strictly sorted matrix, each row is sorted in strictly increasing order, and the first element of the ith row (i!=0) is…
-
Learning Notes #6 Bloom Filters – A Probabilistic Data Structure
Category: UncategorizedI have came across reading Bloom Filters when i wanted to implement username check likewise in instagram. Today i came back to refresh on bloom filters and note it for my future self. What is a Bloom Filter ? A Bloom filter is a space-efficient, probabilistic data structure designed to test whether an element…