Problem Statement Given a two-dimensional list of integers graph representing an undirected graph as an adjacency list, return a two…
Written by Ganesh Iyer A software engineer building tools for AI in healthcare. You should follow them on Twitter
Solving binarysearch.io's collecting coin problem by formulating the recursive solution and then memoizing it and also implementing the top down dynamic programming solution.
We run a preorder depth-first search (DFS) on the root of a binary tree. At each node in this traversal, we output D dashes (where D is the depth of this node), then we output the value of this node.
You are given n people represented as an integer from `0` to `n - 1`, and a list of friends tuples, where person `friends[i]` and person `friends[i]` are friends.
Binary search is something we all learn in CS101 classes. It is a very simple concept however implementing it in 15-20 minutes in a high…
After 10+ years of relying on wordpress I'm finally moving to a JAM stack approach using Gatsby
Dependency Injection(DI) is a set of software design principles that enable engineers to develop loosely coupled code.
Brendan Burns in his paper "Design Patterns for Container-Based Distributed Systems" lays out 3 single node patterns that are used in micro-services architecture. There is some documentation available with examples for implementing these patterns with Kubernetes. However, I couldn’t find a lot of examples with HashiCorp’s Nomad. My goal is to work through them with examples using Nomad as our job schedular.
The circuit breaker is a design pattern, used extensively in distributed systems to prevent cascading failures. In this post, we’ll go through the problem of cascading failures and go over how the circuit breaker pattern is used to prevent it.