#technical-interview
Read more stories on Hashnode
Articles with this tag
Techniques Used Two Pointer Difficulty Easy Approach Have start and end variables which will help us traverse the string s. In the while loop, If...
Techniques Used DFS Graph Difficulty Level Medium Need to Revisit Approach Create a minutes array that will store the amount of time that it...
Techniques Used Binary Search Difficulty Level Easiest Approach Take two pointers (variables), one will point to start, and other end to the...
Techniques Used DFS Graph TopologicalSort Approach We maintain a value (0, 1, -1) for each node, such that 0 shows the visited nodes 1 shows a safe...
Disjoint Sets (Union-Find) Applications Connected Components in Graph problem Detecting cycles in graph. Minimum Spanning Tree (Used in Kruskal's...
Techniques Used Union Find Graph Approach This problem can be simplified as: you are required to find the first edge which when processed by our...
