@kashyapbhansali
Nothing here yet.
Nothing here yet.
Oct 27, 2022 · 5 min read · Breadth-First Search (BFS) & Depth-first Search are traversal techniques for navigating all types of Graphs. Highly recommend reading the post on graph data structure patterns, which builds a foundation of how Graph representations appear in most cod...
Join discussion
Jun 20, 2022 · 6 min read · A graph generally represents a network of nodes or a hierarchy. In real life, it could be a network of roads, people or computers, or a hierarchy of employees in a company. A social network like LinkedIn or Instagram has users as the nodes; the edges...
Join discussion
May 1, 2022 · 5 min read · I recently looked into encrypting AWS DynamoDB Global tables. DynamoDB Global tables are tables with replication enabled to one or more different regions. AWS manages the DynamoDB has server-side encryption enabled by default. Server-side encryption ...
Join discussion
Feb 16, 2021 · 5 min read · The Slow & Fast Pointer approach is the second pattern that will come in handy when working on Linked list problems. We will learn this pattern by applying it to the following three problems: Find Middle of Linked List Find Kth-node from last Dete...
Join discussion
Feb 5, 2021 · 5 min read · We learned in the Basics of Linked Lists that traversal in a Singly Linked list is uni-directional. This means we can only move forward from one node to the other as we always only maintain a pointer to only the next node in the list. After moving, t...
Join discussion