Engrain by ByteRush

DSA.03 7 concepts

Core data structures

Implement and use the core structures.

  1. DSA.03.01Arrays and stringsCoreJuniorBeing written
  2. DSA.03.02Hash maps and setsCoreJuniorBeing written
  3. DSA.03.03Stacks, queues and dequesCoreJuniorBeing written
  4. DSA.03.04Linked listsCoreJuniorBeing written
  5. DSA.03.05Trees and binary search treesCoreJuniorBeing written
  6. DSA.03.06Heaps and priority queuesCoreMid-levelBeing written
  7. DSA.03.07Graphs and tries + Bit manipulation basicsCoreMid-levelBeing written

Interview questions in this module

  1. How does a hash map achieve O(1) average lookups? What is the worst case?
  2. Implement a queue with O(1) enqueue and dequeue in JavaScript.
  3. When is a linked list better than an array?
  4. How is a binary heap stored in an array?
  5. Adjacency list vs matrix: when do you use each?
  6. What is a trie and what is it good for?