Class Days and Class Times: Monday to Friday, 11:00 AM to 2:00 PM
Dates: May 30, 2023 to July 12th, 2023
Lead Instructor: Melissa Lynch
Email: lynch.melissat@gmail.com
TA: Georgina Woo
Email: GEORGINA.WOO30@myhunter.cuny.edu
Slack Workspace: http://interviewbootcamp2023.slack.com
- This README contains the schedule for the course
- The
assignments
folder is where you will put your classwork and homeworks (other than p2p questions). This is also where we will post solutions after the classwork/homework should have already been done.
To get setup to submit classwork/homework, fork this repository.
Then do the following when you do classwork:
- Create a file for each problem you are working on and put it in the appropriate folder.
If you are not able to solve the problem at home then post up a program containing the following:
As comments:
- a description of the approach(es) you thought of
- a description of where you got stuck on these approaches. For
example:
- Was there a flaw in the approach you found and you had to think of a new one? What was the flaw? How did you try to get around it?
- Were you just unable to implement the approach? Which part(s) were you unable to implement, and why?
As code:
- whatever part of a program you wrote if you wrote one
We prefer you submit something that runs, but sometimes we don't get that far. Whether it runs or not, just submit what you have.
05/30 (Tues):
- Course logistics: intro slides Homework: Leetcode reading on hash tables
05/31 (Weds):
- Hackerrank initial assessment
- Work on P2P1 problems
06/01 (Thurs):
- P2P1
06/02 (Friday):
- Interview prep slides: Proactive Communication and Algorithm Design
- Problem solving in class
- Problem solving in class
- N repeated element in size 2N array (warmup)
- Reverse substring between parentheses
- Project Euler #3: Largest prime factor (solution)
- Project Euler #67: Max path sum
- 14 Patterns for Coding Interviews
- Lecture on initial assessment solutions
- Lecture on runtime analysis
06/13 (Mon):
- P2p3
- Mock interview in lecture using this problem
- Tree traversals: Level-order (BFS), recursive DFS traversals
Homework: P2p4 questions due Wednesday at 7PM
06/14 (Tues):
- Find count of number in a sorted array
- Trees
- DFS: Recursive and Iterative Approaches
- Implement a post-order and in-order traversal using an iterative approach
- Zigzag Level Order
- Symmetric Tree
- Validate BST
Homework: P2p4 questions due Wednesday at 7PM; p2p5 questions due Thursday at 7PM
06/15 (Weds):
- Review heaps/priority queue
- Classwork:
Homework: P2p4 questions due TONIGHT at 7PM; p2p5 questions due TOMORROW at 7PM
06/16 (Thurs):
- P2p4
- Dynamic programming
- CTCI Chapter on Dynamic Programming (link coming soon)
- Climbing Stairs
- Possible solutions to the climbing stairs problem (video)
- Space complexity of recursive Fibonacci (video)
Homework: P2p5 questions due TONIGHT at 7PM
06/17 (Fri):
- P2p5
- Dynamic programming
Homework: P2p6 questions due Monday at 7PM
06/20 (Mon):
- NO in-person class
- Midpoint assessment
06/21 (Tues):
- P2p6
- Review solutions to midpoint
Homework: P2p7 questions due Thursday at 7PM
06/22 (Weds):
- Graphs
- Minimum Height Trees (topological sort)
- Is Graph Bipartite?
- Course Schedule (topological sort)
- Longest Increasing Path in Matrix
- Bitwise operations
- Problems:
Homework: P2p7 questions due tomorrow at 7PM
06/23 (Thurs):
- Linked lists
- Misc LC problems
Homework: P2p7 questions due tonight at 7PM
06/24 (Fri):
- P2p7
- Choose problems for peer to peer next week
06/27 (Mon):
- P2p8
- Misc LC problems
06/28 (Tues):
- Final assessment
06/29 (Weds):
- P2p9 (from 10-12)
- Guest lecture at 1
06/30 (Thurs):
- Last day!
- Review solutions to Final Assessment
- Misc LC Problems