It sorts the directed graph in a linear ordering where each vertices like uv from the vertex u to vertex v,u comes before v in the ordering. Applications: School class prerequisites Task scheduling system in a distributed system. etcTopological Sorting Conditions No directed cycles in the graph At least one topological sorting for every Directed Acyclic Graph Kahn's algorithm DFS We cannot u..

The basic technique of most trees(Binary) uses the concept of DFS or BFS. The order of which we explore a three determines if its PRE_ORDER,POST_ORDER,IN_ORDER. I assume this concepts is all about doing same thing in ONLY 3 STEPS. VISIT ROOT - VISIT LEFT - VISIT RIGHT VISIT LEFT - VISIT ROOT - VISIT RIGHT VISIT RIGHT - VISIT LEFT - VISIT ROOT The order of which this visit is done determines if i..

Roger's Head: Big O! Big O! Big O! Big O! Big O! Big O! Big O! Big O! Big O! Big O! ... ... ... Big O notation is a simplified analysis on an algorithm's performance as the input size changes. A better quick cheat on what the complexity on some algorithms can be referred from BigO Cheat Sheet . Type of Complexity Time Space O(1) Constant Time In simple terms: As the input size changes, t..

I can be honest initially matrix, or any form of 2d problems seems very complicated for me usually. Trust me this question seems like ROCK CLIMB to me at first. After getting through explanation of how to tackle this question,IT SEEMS WAYYYYYYY easier than it actually looks. Leetcode Question explanation [`Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution mus..

Few days ago I spent almost 30min figuring out what on earth was wrong this event toggleClass,hasClass ,$(this). As the code seem to be fine. $(".s_nav_menu").on('click', ()=> { if( $(this).parent().next('div').hasClass('p_t_tap_inner')){ $(this).parent().toggleClass( "on" ); } }); after checking the debug tools, I realized the if statement returns false. This is not beca..