Reverse an array without using native .reverse() method.
whiteboarding a problem is very new to me, so this challenge for this assignment was to reference the whiteboard template and try to format mine in the same way. Not knowing much about Big O right now or how to calculate it yet, I left that part (and some others that didn't seem applicable to me at the time) out of my whiteboarding for this assignment.
This code did not need to be run or tested for the assignment today, it was a whiteboard challenge only.
Add a value to the middle on an array without using native JavaScript methods
I could not find a solution to this without using a native method so I just used .splice(). Since this is a whiteboarding assignment per the instructions, I used this opportunity to practice my whiteboarding skills rather than wracking my brain trying to re-write .splice(). I will update this after code review tomorrow, when I will hopefully know how to complete the actual challenge.
This code did not need to be run or tested for the assignment today, it was a whiteboard challenge only.
Add a value to the middle on an array without using native JavaScript methods
Read about binary search in the documentation provided by the code challenge, and did my best to implement when I leared.
This code did not need to be run or tested for the assignment today, it was a whiteboard challenge only.
I worked with Nate to perform a mock interview. I completed a challenge that took in a given matrix and then found the sum of each array in the matrix, returning the in a new array. Nate took on a challenge to find the nth number in the Fibonacci sequence and return the value of it.
Nate and I helped each other out with the challenges, though I think he was a better help to me than I was to him. It really helped for me to be able to talk through my thought process with someone.
I worked alone, lacking an interviewer. I completed both challenge, though the second one is still buggy. The first challenge was to reverse a linked list without using native methods, and the second challenge was to verify whether or not a linked list is a palindrome.
I think that my code for the reverse list challenge would work in a real-life scenario. However, my solution to the verify palindrome challenge has no many holes in the logic and would not work in the real world.
I worked with Jonathan and Daniel for this whiteboard interview. I interviewed both Daniel and Jonathan, and Jonathan interviewed me. My challenge was to write a function called maxStack() that returns the node with the max value within the stack. Daniel had to write a duckDuckGoose() function that loops through a linked list of names, removing the Kth node from the list until there is onle one node remaining. Jonathan worked on last week's problem of verifying whether or not a linked list is a palindrome.
First of all, interviewing Jonathan while he worked through the problem that was giving me trouble last week was very helpful to me. I know a few ways I can fix my original solution to make it functional. Secondly, I recieved feedback from Jonathan during my interview about talking through my proposed solution at the beginning of the interview, before diving in to write code.
I am confident my code will work, I feel as though I was able to catch the edge cases and make any needed adjustments to my code as I went.
This was a whiteboard only warm-up. This code has not been run or tested.
I worked solo for this interview, and thus it was not an interview, but simply a whiteboard challenge.
These sorting algorithms have been very hard for me to understand, even when I see an example. I used the internet for help on these two, and while I get the overall gist of how they work, the code itself is pretty confusing to me still and it was hard for me to describe what was happening while trying to reference the code.
I know the code works, because I didn't rite it all myself. However, I could not tell you fully how or why it works. So. There's that.