I believe one of my answers has brought you on my profile. Since you're here, check some of my other answers which you might find interesting as well :)

- 2D Segment/Quad Tree Explanation with C++
- DFA construction in Knuth-Morris-Pratt algorithm
- Minimum number of edges to be deleted in a directed graph to remove all the cycles
- Count number of inversions in an array using segment trees
- What is the best algorithm to shuffle cards?
- Two elements of an array whose XOR is maximum efficiently
- Monolith to Microservices
- Raising a number to a huge exponent
- HashMap Space Complexity
- Best practices for microserviced applications