Count Strongly Connected Components Using Kosaraju's Algorithm
Asked at Expedia · Coding & Leetcode-style Questions · Difficulty: Medium
Given a directed graph with `n` nodes labeled from `0` to `n - 1` and `m` directed edges.
Loading the problem…
More Expedia interview questions
- Implement a Basic Tokenizer and Train a Simple LLM-like Model in a Notebook Case Study
- Number of Provinces
- Minimum Additional Capabilities to Equalize Team Work Hours
- Get Maximum Efficiency
- Get Minimum Steps
- Scattered Palindrome Substring Count (Swappable to Palindrome)