Arrays

Contiguous indexed sequences.

4 subjects · 6 topics · 2 cheatsheets

Subjects covering this category

4 subjects
  • Subject · Intermediate to Advanced

    Holding data in the right Java collection, and transforming it without writing a loop.

    • Collections
    • Pipelines
    9 topics · 78 cardsnot started
  • Subject · Intermediate to Advanced

    Recognising which of the common problem-solving patterns an unseen coding problem needs, and solving it in Python, Java or TypeScript within the time an interview allows.

    • Approach
    • Array and Number Patterns
    • Linked List Patterns
    17 topics · 135 cardsnot started
  • Subject · Beginner to Advanced

    Writing Java that compiles, runs, and models a problem with objects.

    • The Language
    • Objects
    • When Things Go Wrong
    15 topics · 131 cardsnot started
  • Subject · Beginner to Advanced

    Choosing a data structure by the cost of its operations, and implementing arrays, linked lists, stacks, queues, hash tables, trees, heaps, tries and graphs in Python, Java and TypeScript.

    • Measuring Cost
    • Sequences and Lookup
    • Recursion and Trees
    15 topics · 122 cardsnot started

Cheatsheets

2 cheatsheets
  • Cheatsheet · Coding Interview Patterns

    Fourteen coding interview patterns on one page: the property that points to each, what it costs, when it fails, and its loop in Python.

    2 entries here
  • Cheatsheet · Data Structures

    Every data structure in the subject on one page: what each one is for, what its operations cost, and how to choose.

    1 entry here

In Arrays itself

6 topics
  • Data Structures

    Arrays and strings: why reading by index is instant, why inserting in the middle is not, and how a dynamic array grows without slowing every append.

    Beginner to Intermediate9 cards · 4 qnot started

  • Java

    Java arrays: a fixed run of values under one name, creating and filling one, zero-based indexes, and why an array cannot grow.

    Beginner to Intermediate8 cards · 5 qnot started

  • Coding Interview Patterns

    Prefix sums: precomputing running totals so any range sum is one subtraction, and counting the runs that hit a target with a hash map.

    Intermediate to Advanced8 cards · 4 qnot started

  • Coding Interview Patterns

    Grid traversal: treating a grid of cells as a graph for breadth-first and depth-first search, flood fills and searches from many starting cells.

    Intermediate to Advanced8 cards · 4 qnot started

  • Java Collections and Streams

    ArrayList vs LinkedList: two lists with the same methods and opposite costs, how an ArrayList grows, and removing while iterating.

    Intermediate to Advanced8 cards · 6 qnot started

  • Java Collections and Streams

    Java generics: type parameters, what the compiler checks, type erasure, wildcards, and what erasure forbids.

    Intermediate to Advanced9 cards · 5 qnot started