Save templates for both Kosaraju and Tarjan SCC algorithms. Kosaraju template: Two DFS functions (one for finish times, one for SCCs), a stack for finish order, transpose graph, and two visited arrays. Tarjan template: One DFS function with , , arrays, and a stack for the current DFS path.
Check low[v] = disc[v] to detect SCC roots. Both templates are about - lines of code. Practice writing them from memory until you can implement either algorithm in minutes.