- Identify similar patterns Plan - Come up with algorithm, proof it works Implement - Code Review - Test solution works as expected Evaluate - Analyze run time and space complexity
- Identify similar patterns Plan - Come up with algorithm, proof it works Implement - Code Review - Test solution works as expected Evaluate - Analyze run time and space complexity
2, 6, 6, 6, 10, 14, 14} ; Return -> {1, 2, 6, 10, 14} Plan: - possible solutions: (1) iterate through array, put values in hash table, if value already exists, don't add to numsToReturn (2) sort array, add integer to numsToReturn if previous integer is not the same
2, 6, 6, 6, 10, 14, 14} ; Return -> {1, 2, 6, 10, 14} Evaluate: what’s the space / run time complexity of our solution? what tradeoffs did we have to make?
get more comfortable with UMPIRE Review UMPIRE together, make sure everybody has a good understanding of what should be done at each step Review a sample problem solved with the UMPIRE method
get more comfortable with UMPIRE Review UMPIRE together, make sure everybody has a good understanding of what should be done at each step Review a sample problem solved with the UMPIRE method Create a shared document in repl.it to solve the problem together with the UMPIRE steps. Round robin status!
get more comfortable with UMPIRE Review UMPIRE together, make sure everybody has a good understanding of what should be done at each step Review a sample problem solved with the UMPIRE method Create a shared document in repl.it to solve the problem together with the UMPIRE steps. Round robin status! After 45 minutes, we’ll regroup and review the problem
portal lecture slides also linked in course portal Review solutions to our in class exercises Work on optional practice problems provided in course portal
portal lecture slides also linked in course portal Review solutions to our in class exercises Work on optional practice problems provided in course portal Complete HackerRank assessment!