Skip to content
CodeWiki
Practice
Paths
Tracks
Cheatsheets
Playground
Glossary
AI era
Search
⌘K
English
English
Chinese
Practice
Paths
Tracks
Cheatsheets
Playground
Glossary
AI era
English
English
Chinese
Practice
/
Fill in
/
CS foundations
/
CS foundations
Name the state a graph traversal must maintain to avoid revisiting vertices indefinitely …
from CS foundations
advanced
1 min
Name the state a graph traversal must maintain to avoid revisiting vertices indefinitely in a cycle.
Check
Ask AI about this kata
Report an error
previous kata
Which condition must hold before binary search can safely discard half of the remaining r…
Quiz
next kata
A routine compares every pair among `n` records once. Which time bound describes its domi…
Quiz
A new version is available
Reload