
DDIA - Chap04 - Enconding and Evolution
All applications change, as do their requirements. With such changes, it’s highly likely that the underlying data models also change. In this blog post, we will mainly discuss this. Part of the ...

All applications change, as do their requirements. With such changes, it’s highly likely that the underlying data models also change. In this blog post, we will mainly discuss this. Part of the ...

Storage and retrieval are also one of the major aspects after selecting the data model. Even though most of the developers are not going to make any changes to the storage engine, however, modern d...

The most important aspect of developing web-application is to determine the data model for it. A complext application might have multiple layers, however, ultimately it needs to access previously s...

This wiki contains a couple of well-defined problems solved via Breadth First Search (BFS) traversal. Part of the BFS Problems series (2 parts) BFS Problem Sets Part I BFS Problem Sets Part II ...

This wiki contains a couple of well-defined problems solved via Breadth First Search (BFS) traversal. Part of the BFS Problems series (2 parts) BFS Problem Sets Part I ← you are here BFS P...

This wiki contains a couple of well-defined problems solved via Binary Search algorithm. Part of the Binary Search Problems series (2 parts) Binary Search Problem Sets Part I Binary Search Prob...

This wiki contains a couple of well-defined problems solved via Binary Search algorithm. Part of the Binary Search Problems series (2 parts) Binary Search Problem Sets Part I ← you are her...

Search is one of the first areas where LLMs got their industrial use. Currently, many organizations started looking into enhancing the user experience with search by introducing LLMs. Multiple star...

Recent large language models have opened a portal for different possibilities across domains. From a programmer perspective, it can provide a quick-fix recommendation, and answer generic questions....
Union-find data structure is used extensively to solve problems associated with disjoint sets. Two sets are called disjoint sets if they don’t have any common elements. It supports the following op...