Software Engineering Best Practices, System Design, High Scale, Algorithms, Math, Programming Langua
The JSON data model and the relational databse and sql model
Building more complex graph algorithms based on the basic building blocks such as DFS and from there
What are the smells for a bad design document, What makes a design document good, what should you in
Rooted graphs, graphs, DAG, different ways of storing graphs bipartite graphs etc.
Machine learning offers a fantastically powerful toolkit for building useful complexprediction syste
In statistical hypothesis testing, a result has statistical significance when it is very unlikely to
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and
Peter Naur (25 October 1928 – 3 January 2016)[1] was a Danish computer science pioneer and Turing aw
Fast development. Flutter's hot reload helps you quickly and easily experiment, build UIs, add featu
Vim is an extremely powerful editor. Not only you can use it from command line but also from I
ISO 8601 Data elements and interchange formats – Information interchange – Representation of dates a
Should you invest time in using Vim for software development? What should you do with Vim? How do yo
Why Google Stores Billions of lines of code in a single repository - this is a brief summary of a re
In a paper named Fixed it for you. Protocol repair using lineage graphs it is described how ma
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which
As developers, we sometimes want to check the performance of our server, we are not system administr
In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) tim
cgroups is a Linux kernel feature that limits, accounts for, and isolates the resource usage of a co
Backtracking is a general algorithm for finding all solutions to some computational problems, notabl