Mark As Completed Discussion
Home > Mission March > Mission March > Data Structures and Algorithms

Try this exercise. Click the correct answer from the options.

Which of the following terms is used to describe the amount of time taken by an algorithm to run as a function of the input size?

Click the option that best answers the question.

  • Time complexity
  • Space complexity
  • Algorithm complexity
  • Code complexity

Programming Categories

  • Basic Arrays Interview Questions
  • Binary Search Trees Interview Questions
  • Dynamic Programming Interview Questions
  • Easy Strings Interview Questions
  • Frontend Interview Questions
  • Graphs Interview Questions
  • Hard Arrays Interview Questions
  • Hard Strings Interview Questions
  • Hash Maps Interview Questions
  • Linked Lists Interview Questions
  • Medium Arrays Interview Questions
  • Queues Interview Questions
  • Recursion Interview Questions
  • Sorting Interview Questions
  • Stacks Interview Questions
  • Systems Design Interview Questions
  • Trees Interview Questions

    • Popular Lessons

  • All Courses, Lessons, and Challenges
  • Data Structures Cheat Sheet
  • Free Coding Videos
  • Bit Manipulation Interview Questions
  • Javascript Interview Questions
  • Python Interview Questions
  • Java Interview Questions
  • SQL Interview Questions
  • QA and Testing Interview Questions
  • Data Engineering Interview Questions
  • Data Science Interview Questions
  • Blockchain Interview Questions
  • MERN Stack - Introduction
  • Introduction to Redis
  • Learning JavaScript Basics
  • NP-Completeness and Approximation Algorithms
  • Expanding Data Structure Capabilities