How topological sort is a natural outcome of reversing Postorder DFS
Reversing the result of a postorder DFS can result in a topological sort order for any graph. Its fairly intuitive how.
Read more ⟶Data purging: A good use-case for database triggers
Leveraging Database Triggers for Effective Data Retention Policies on Dependent Tables
Read more ⟶Why you should almost never use Abstract Classes
**almost**
Read more ⟶