BigOCheck

Estimate time complexity from loop structure and recursion — with on-device AI reasoning.

Analyzed locally — unlike AI complexity sites, your code is never uploaded

Your code (any C-like / Python-like language)

function hasDuplicate(arr) {
  for (let i = 0; i < arr.length; i++) {
    for (let j = i + 1; j < arr.length; j++) {
      if (arr[i] === arr[j]) return true;
    }
  }
  return false;
}

—Estimated time complexity

—Estimated extra space

Why

Structural estimate — it reads loop nesting, recursion, and divide-and-conquer patterns. Hidden costs inside library calls (sort, includes, slicing) are flagged when recognised but can't all be known statically.