Angular Component Life Cycle hooks in simple languageI remember when I started learning Angular many years ago, I found component lifecycle hooks concept very confusing. Thanks to the writing…Jul 23, 20241Jul 23, 20241
Serializable isolation level & 2PLSerializable isolation level guarantees that even multiple transactions are executed concurrently, they will be executed as if they are…Feb 4, 2024Feb 4, 2024
Most Common Problems in Database TransactionsIntroduction: Database transactions are a fundamental aspect of ensuring data integrity, consistency, and reliability. However, they come…Jan 20, 2024Jan 20, 2024
Understanding Different Types of Database PartitioningDatabase partitioning is a crucial technique for managing large datasets efficiently. There are several types of partitioning strategies…Jan 5, 2024Jan 5, 2024
Aspect Oriented Programming terminologies you should be familiar withAspect: An aspect is a modular unit that encapsulates cross-cutting concerns in a program. Cross-cutting concerns are functionalities that…Dec 26, 2023Dec 26, 2023
Exploring the Modified Binary Search AlgorithmBinary search is a classic algorithm used to efficiently search for an element in a sorted array. However, there’s a modified version of…Aug 27, 202314Aug 27, 202314
Does Dijkstra algorithm always find shortest distance when it reaches any node for the first time?Yes, Dijkstra’s algorithm always finds the shortest distance to a node when it reaches that node for the first time during its execution…Jul 22, 2023Jul 22, 2023
Some notes regarding single source shortest path algorithmsDijkstra and Bellman ford algorithms are popular algorithms for finding shortest distance between the nodes of a weighted graphs. Dijkstra…Jul 17, 2023Jul 17, 2023
Some interesting concepts and data structuresGoogle S2: S2 is a library developed by Google for efficiently representing and manipulating geometric shapes on the surface of a sphere…Jun 18, 2023Jun 18, 2023
Minimum Spanning Trees and algorithmsMinimum Spanning Trees (MSTs) are tree-like subgraphs of a connected, undirected graph that span all the vertices while minimizing the…Jun 18, 2023Jun 18, 2023
Difference between Eulerian Path vs Minimum Spanning TreesMinimum spanning tree (MST) and Eulerian graph are two different concepts in graph theory:Jun 18, 2023Jun 18, 2023
Differences between Code Smells and Anti-patternsQuite often, developers use the terms like Code smell and anti-pattern interchangeably to indicate some problem in the source code. As if…May 30, 2021May 30, 2021
