Technical Job Interview Prep (Data Structures & Algorithms) / In-Person

Welcome to our interview prep talk with recent Virginia Tech graduate, Yingquan on Data Structures & Algorithms in interviews.

In this talk, we will go over some fundamental principles and techniques for mastering Data Structures and Algorithms (DS&A) for the job interview. Given the state of the economy, technical interviews have gotten harder and there’s often multiple rounds of technical interviews for any technical job. This adds a lot of stress to any interviewee. However, with the right techniques and the right problem solving approaches using Python, the technical interview can be mastered and it doesn't have to be a stressful situation!

Some of the most common techniques include the following: 1) Sliding Window, 2) Two Pointers, 3) Fast and Slow Pointers, 4) Merge Intervals, 5) Cyclic Sort, 6) In-Place Reversal of Linked List, 7) Tree BFS, 8) Tree DFS, 9) Two Heaps, 10) Subsets, 11) Top K Elements, 12) K-Way Merge, 13) Topological Sort.

**Please bring your personal laptop**
There are 25 desk seats available, please RSVP via Meetup so we can have an accurate headcount