I wonder why CockroachDB is not picking up steam, It’s written by the three of the most prolific engineers on the planet: Spencer Kimball, Peter Mattis, and Ben Darnell. I am a big fan of Kimball and Mattis as they gave the world, for free and open source, The GTK…

Part I: https://mohammedzu.medium.com/graal-the-holy-grail-vm-part-i-9b0c074088be Let’s complete the Graal saga with some hands-on… I am going to demonstrate with a test project using Quarkus, a simple rest api called ‘yo yo!’ ← Name rings a bell? yes yes, the project which fetched 1M investment in no time, back in the web 2.0…

It’s been a while since i have written anything, and i am really disturbed today about something, so either i could just keep ruminating about what happened or find a way for a positive distraction, so thought well!, …

Yesterday (March 8th 2021), Our Tiger passed away after being with us for 8+ years, The guy was a very smart fish with his big eyes and an attitude, he’d recognized faces judging from the fact that he had distinct behavior for each of us at home, Z used to…

Constant time probabilistic data structure for counting streaming events, in Python. Count Min Sketch is a fast and highly space efficient probabilistic data structure that serves as a frequency table of events in a stream, Similar to Bloom Filter, Count Min Sketch utilizes fast non-cryptographic hash functions (k) for mapping…

Use Case: User login handle existence test during profile creation using Bloom Filter, in Python. Part I of the 2020 weekend coding series! Bloom Filter is a highly space efficient probabilistic data structure that guarantees zero false negatives and tunable probability false positives. Bloom filters are popularly used for filtering…

Greedy BFS Graph coloring Algorithm in Python Part IV and finale of the Holidays 2019 coding series… Happy 2020 Y’all This implementation illustrates Graph Coloring (An NP-Complete Problem) of US map using Greedy BFS. Graph coloring In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called…en.wikipedia.org Four color theorem In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane…en.wikipedia.org

Part III of the Holidays Coding Series. Directed Acyclic Graphs are Graphs without cycles with the property that an edge E exists between any two nodes u, v such that E= {u, v} but *not* {v, u} and no back edges. This property makes DAGs suitable for building dependency chains…

Double Maps and a Double Linked List implementation of a classic cache management Algorithm in Python. Part II of the Holiday Coding Series — Happy Holidays! Part I (LRU Cache): https://medium.com/@mohammedzu/least-recently-used-lru-cache-in-pythonic-art-bda8a62fce36 A Least Frequently Used Cache (LFU) evicts the least frequently used key, value tuple when the cache is full, to do so the frequency of each key is updated on each access, a map of frequencies pointing to a double linked list keeps track of all items having the same access frequency.