Все публикации

0:01:01

How chain replication provides strong consistency in distributed systems? #tech #systemdesign

0:18:35

How Meta built a Highly Available, Strongly Consistent Object Store | System Design

0:00:58

#Shorts How Write-Ahead Logs manage file size using segmentation #coding #databases #durability

0:19:07

How to build a Durable Write Ahead Log in Go | Segmentation, Auto Recovery, Checksums

0:00:50

#shorts Designing a distributed task scheduler #tech #programming #systemdesign #software #coding

0:34:20

How to build a Distributed Task Scheduler with Go, Postgres, and gRPC

0:24:39

Merge K Sorted Lists (LeetCode) | Interview Question Explained

0:13:10

Merge Intervals (LeetCode) | Interview Question Explained

0:08:15

Reduce Array Size to the Half (LeetCode) | Interview Question Explained

0:12:43

Add Binary (LeetCode) | Adding Binary Numbers as Strings Explained

0:16:22

Course Schedule II (LeetCode) | DFS Topological Sort Explanation

0:09:27

Rotate List (LeetCode) | Linked List Interview Question Explanation

0:13:40

Spiral Matrix (LeetCode) | Spiral Ordering of a Matrix Explanation

0:17:59

Reverse Sublist in Linked List | (Reverse Linked List II on LeetCode) Explanation

0:10:40

Island Perimeter (LeetCode) | Interview Question Explanation

0:07:46

Count Largest Group (LeetCode) | Interview Question Explanation

0:05:17

Increment Integer Represented as an Array (Plus One on LeetCode) | Interview Question Explained

0:12:24

Number of Subsequences That Satisfy the Given Sum Condition (LeetCode)

0:10:25

Arranging Coins (LeetCode) | Binary Search Algorithm Explanation

0:18:21

Word Search (LeetCode) | Interview Question Algorithm Explanation

0:31:22

Edit Distance between 2 Strings | The Levenshtein Distance Algorithm + Code

0:14:36

4Sum (LeetCode) | Interview Question Algorithm Explanation

0:22:59

Unique Binary Search Trees (LeetCode) | Dynamic Programming Explanation

0:12:22

3Sum (LeetCode) | Interview Question Algorithm Explanation