Skills101
← Free DSA Skill Check

DSA Skill Check

15 questions20 minPass: 60%+25 XP on first pass

15 mixed questions across the core DSA topics. 20 minutes. Explanations after you submit.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    What is the time complexity of searching for a value in an unsorted array?

  2. Question 2

    What is the time complexity of this code?

    i = 1
    while i < n:
        i = i * 2
    
  3. Question 3

    Which data structure gives O(1) average-time lookups by key?

  4. Question 4

    nums = [2, 7, 11, 15], target = 9. Which indices does Two Sum return? (format: 0,1)

  5. Question 5

    For which input is two-pointer pair search (opposite ends) directly applicable?

  6. Question 6

    What is the length of the longest substring without repeating characters in "pwwkew"?

  7. Question 7

    Binary search requires the data to be…

  8. Question 8

    Which pointer technique detects a cycle in a linked list in O(1) extra space?

  9. Question 9Select all that apply

    Which are valid parenthesis strings? (select all that apply)

  10. Question 10

    For a stack, which operation removes the most recently added item?

  11. Question 11

    Inorder traversal of a Binary Search Tree returns the values…

  12. Question 12

    Which traversal uses a queue?

  13. Question 13

    How many ways are there to climb 4 stairs taking 1 or 2 steps at a time?

  14. Question 14Select all that apply

    Which problems are typically solved with dynamic programming? (select all that apply)

  15. Question 15

    Every number in [4, 1, 2, 1, 2] appears twice except one. What does XOR-ing all of them give?