Microsoft Word - Interview Training Guide.docx - Kaleb Mckelvey

Please enable JavaScript to view the full PDF

Kaleb McKelvey’s Interview Training Guide Essential Data Structures Data Structure Researched? Code Pen? FlashCards Comfortable? Static Arrays Dynamic Arrays Multi Dimensional Arrays Linked List Doubly Linked List Circular Linked List Stack Min-Max Stack Queue Tries Hash Tables / Maps Union Sets Binary Trees Binary Search Trees N-Ary Trees AVL Tree Red Black Tree 2-3 Tree Graphs Heaps Sorting Sort Researched? Code Pen? FlashCards Comfortable? Insertion Sort Selection Sort Bubble Sort Heap Sort Merge Sort Quick Sort Searching Search Researched? Code Blog? FlashCards Comfortable? Pen? Binary Search Linear search Bread First Search Depth First Search Algorithms Algorithm Type Researched? Code FlashCard Comfortable? Pen? s Greedy Algorithms Dynamic Programming Divide and Conquer Famous Algorithm Researched? Code FlashCard Comfortable? Pen? s Dijkstra Kadane Breadth first Traversals Depth first traversal Big O Notation Researched? Code FlashCard Comfortable? Pen? s Ascending order levels Rule of thumbs System Design System Design Researched? FlashCards Comprehension ? Perf vs Scalability Latency vs Throughput Availability vs Consistency CAP Theorem Consistency Patterns Availability Patterns Domain Name System Content Delivery Network Load Balancer Reverse Proxy Application Layers Databases Caching Asynchronism Communication Protocols Security Powers of Two Latency Numbers Real World Architectures Company Architectures Operating System topics OS Topic Researched? Code Pen? Blog? FlashCards Comprehension ? Semaphore Threading Locks Side Note: One last topic I didn’t take time to learn since my interview process ended was Bit Manipulation. I felt it wasn’t worth my time for the roles I interviewed for, but possible it can come up.