- What worked well in your process?
- What was difficult/where did you struggle?
- What feedback/discussion did you have with your peer?
- Is there anything you want to change about your approach to the next technical challenge?
- If this isn’t your first technical challenge:
Were you able to improve your approach? What went better?
Worked Well? Breaking down the algorithm into smaller steps for solving; no small help that we did a question just like this during class today.
What was difficult? I struggled with researching for a bit, and with finding a potential approach that would do better than O(n) time.
Feedback/Discussion? My group members did it pretty similarly - learned today that there's a method in Ruby 3.0, intersection to help with problems like this next time, assuming it's allowed to use built-ins.
It may also be possible to iterate through the array just twice, with a comparison .include? nested loop array1 versus array2, and then that result against array3.
Worked Well? Met with my group first thing to talk about the problem, ensure we understood it, and take some high-level notes on steps to solve it. Kevin mentioned first thing that it would make the most sense to solve recursively.
What was difficult? Recursion 😵💫 I think I was close, but I wouldn't have thought to have a second nested loop and I didn't place to call to self in the right place.
Feedback/Discussion? We all seemed to be struggling with the same logic there the last time we met, and seems like most of us ended up using a permutation of Brian's javascript solution/logic.
For next time: think about the potential utility of a class (usually not required in an interview, but could be helpful). It's hard to say what went better today versus yesterday since I didn't reach a working solution on my own. I liked the team approach and accountability of other people sitting together quietly on a zoom with me.