BYTE BATTLE PSEUDO CODE QUESTIONS (Easy)

Pseudocode:

FOR i from 0 to n-1
    FOR j from i+1 to n-1
        IF nums[i] + nums[j] == target
            RETURN [i, j]
What is the time complexity?

• O(n)

• O(log n)

• O(1)

Pseudocode:

FOR i from 0 to n-1
    FOR j from i+1 to n-1
        IF nums[i] + nums[j] == target
            RETURN [i, j]

What is the requirement for this algorithm?

• Array must be sorted

• Array must be reversed

• Array must be unique

• No condition

What technique is used?

• Recursion

• Sliding Window

• Two Pointer

• Backtracking

What does this code check?

• Sorting

• Palindrome

• Duplicate

• Rotation

What problem is solved?

• Sorting

• Maximum Subarray

• Searching

• Graph traversal

What is the time complexity?

• O(n)

• O(n²)

• O(log n)

• O(1)

What is the output behavior?

• The output is a constant value.

• The output changes based on input.

• The output is always zero.

• The output is unpredictable.

Which operation is described by the following options?

• Sort array

• Move all zeros to end

• Remove duplicates

• Reverse array

Which data structure is used?

• Queue

• Array

• Stack

• Linked List

Pseudocode: nums = [1, 2, 3, 4] sum = 0 FOR i from 0 to length(nums)-1 sum = sum + nums[i] PRINT sum

• A) 6

• B) 10