🚀 Ava-coding
About Me

ALGORITHMS & DATA STRUCTURES

  • Time and Space Complexity
    • What is Time and Space Complexity, exactly?
    • How to never have a code limit
    • What is a logarithm?
    • Computer memory and static arrays
    • Dynamic arrays and amortized constant
    • Design thinking: which algorithm is better
  • Arrays & Strings manipulation
    • Linked lists
      • Binary search
        • Stacks, Queues and Dequeues

          This chapter would be published on 22nd of June 2025.

          Ava is having fun!
          The source code is licensed MIT.
          The website content is licensed
          CC BY NC SA 4.0.