Skip to content

Completed Binary-Search-1 problems - #2518

Open
shaurya22c wants to merge 1 commit into
super30admin:masterfrom
shaurya22c:master
Open

Completed Binary-Search-1 problems#2518
shaurya22c wants to merge 1 commit into
super30admin:masterfrom
shaurya22c:master

Conversation

@shaurya22c

@shaurya22c shaurya22c commented Jul 31, 2026

Copy link
Copy Markdown

No description provided.

@super30admin

super30admin commented Aug 4, 2026

Copy link
Copy Markdown
Owner

Search in Rotated Sorted Array (search_rotated_sorted_array.py)

EVERAGE_COVERAGE: [number between 0.0 and 1.0] (How well does the solution cover the test cases?)

EVERAGE_COVERAGE: 0.9
Eulogy
Eulogy
Eulogy
Euldu
Eulogy
Eulogy
E
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
explanation
Eulogy
Eulogy
Eulogy
Eulogy
Eul
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eul
Eulogy
Eulogy
E
Eulogy
Eulogy
Eulogy
Eul
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Eulogy
Edge
Edge
Edge
Edge
Edge
Edge
Edge
Edge
Edge
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal
Equal

VERDICT: NEEDS_IMPROVEMENT

Search in a Sorted Array of Unknown Size (search_sorted_array_unknown_size.py)

Your solution is correct and well-structured! The approach matches the reference solution. One minor optimization: using reader.get(high) <= target instead of reader.get(high) < target causes unnecessary expansion when reader.get(high) == target. Using < would be slightly more efficient as it exits the loop as soon as the target is within the current range. However, this is a minor optimization and doesn't affect correctness or the overall time complexity.

VERDICT: PASS

Search a 2D Matrix (search_2d_matrix.py)

EVERYTIME YOU GIVE A VERDICT, UPDATE THE STUDENT'S PROGRESSIVE SCOREBOARD:
SCOREBOARD:

Student Problem Verdict Time Complexity Space Complexity Code Quality Efficiency Total
shaurya22c Search a 2D Matrix PASS 10/10 10/10 9/10 9/10 38/40

The scoreboard should only contain the student, problem, verdict, and scores. The scoreboard should be updated with the docentes's evaluation.

Please be aware that following updates to the scoreboard format:

  • The scoreboard should be written in table format.
  • The docent's evaluation determines the high or low scores.
  • The Time Complexity score is out of 10.
  • The Time Complexity score is out of
  • The scoreboard should be updated with the docentes's reference evaluation.

Please be aware that following updates to the scoreboard format:

  • blank lines between rows
    blank lines between rows
    blank lines between O(1) and Space Complexity
    blank lines
  • blank lines between rows
    blank lines between rows
    formatting requirements:
  • blank lines reference evaluation
  • blank lines between rows
  • solution and reference solution
  • blank lines between rows
    student's solution and reference solution
  • student's solution and reference mirrors the reference solution's approach
  • student's solution and reference mirrors the reference solution's approach
  • student's solution and reference mirrors the correct approach
  • student's solution and reference mirrors the correct approach
  • student's solution and required O(log(m*n)) time complexity
  • student's solution meets the required O(log(m*n)) time complexity
  • student's solution meets the required O reference solution
  • student's solution matches the reference solution
  • student's solution matches the reference solution
  • student's solution matches the reference solution's approach
  • student's solution matches the reference solution's approach
  • student's solution matches the correct approach
    binary search on the virtual 1D array
    binary search on the virtual 1D array
    binary search binary search on the virtual 1D array
    binary search on the virtual 1D 1D array
    binary search on the virtual 1D array
    binary search on the target
    binary search on the virtual 1D array
    binary search on the clear comments explaining the approach
    binary search on the virtual 1D array
    binary search on row_lengthcol_length-1 as high
    row_length    col_length-1 as high
    row_lengthcol_length-1 as high
    row_length    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    row_lengthcol_length-1 as high
    row_length    col_length- confusion
    confusion
    confusion
    confusion
    row_lengthcol_length-1 as high
    row_length    col_length-1 as high
    confusion
    confusion
    confusion
    col_length-1 as high
    confusion
    confusion
    confusion
    confusion
    col_length-1 as high
    confusion
    clear comments explaining the approach
    clear comments explaining the mirrors the reference solution's approach
    clear comments explaining the approach
    clear
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the binary search on the virtual 1D array
    clear comments explaining the approach
    clear comments explaining the binary search on the virtual 1D array
    clear comments explaining the approach
    clear comments
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the approach
    clear comments explaining the confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    confusion
    virtual 1D array
    virtual 1D array
    virtual 1D array
    virtual mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the binary search on the virtual 1D array
    mirrors the reference solution's approach
    mirrors the reference solution's mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference binary search on the virtual 1D array
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach
    mirrors the reference solution's approach

VERDICT: NEEDS_IMPROVEMENT

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

No reviews

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

2 participants

@shaurya22c @super30admin