Position: Full-Stack SWE\nWhen: June 2021\nWhere (location): Hawthorne, CA\n\n---\nQuestions, as asked by recruiter:\n* What are hash tables?\n* How do you deal with conflicts in a hash table?\n* How do you resize a hash table?\n* How does a hash table look like in memory?\n* What is big O notation?\n* What is the runtime of inserting an element at the end of a dynamic array?\n* What is the runtime of inserting an element in the middle of a dynamic array?\n* What is the runtime of inserting an element the correct place in a sorted linked list?\n* What is the worst case runtime of quick sort?

Position: Full-Stack SWE\nWhen: June 2021\nWhere (location): Hawthorne, CA\n\n---\nQuestions, as asked by recruiter:\n What are hash tables?\n How do you deal w