The time/date is when the commit was submitted.įirst design a graphical model for all of the commit data. There are a variable number of edited files in the commit, each receiving its own line. There are a variable number of reviewers, delimited by commas if there are no reviewers, that line is absent from the file. The commit number is unique and is generated in synchronous order. Each file represents a single commit and they are formatted as follows:
#PEG SOLITAIRE JAVA OOD CODE#
The setup is that we are given a series of text files which contain information regarding a code repository's commits.
if you go to the right, you will get stuck.Īfterwards, the interviewer adds a space to the right of ‘Z’ to test the code. OK//to select Nnote: Be careful when you’re at Z. ZWrite code to give the character sequence given a word, For example, if the word is “CON”, the function will print this:
#PEG SOLITAIRE JAVA OOD HOW TO#
For example, if the array is this:ġ,2,3,6,9,8,7,4,5The array is an NxN array.The final question was just how to write a connection pool (i.e, a class that returns connections to the user, and if the user is done, returns them back to the pool) Given a 2-d array, write code to print it out in a snake pattern. If nodes are added/removed to a linked list on one computer, all others must reflect this change. How would you keep track of all the people you are connected to.ģ) What is the run time of the A* search (only because I mentioned it somewhere along the line).Second person:ġ) Write code to find duplicates in a linked listĢ) How would you synchronize a linked list across multiple computers. For example:ġ) How would you write a pancake sort routineĢ) You have a network of friends (linked in friends, facebook friends, etc). Simply high level questions about how to achieve certain things. The problem was this: Write code to verify a Sudoku board.
Things like thatThe second phone interview was purely coding 1 big long, but easy problem. Here are a couple:ġ) Why are calls to virtual functions slowerĢ) How would you find the maximum occurrence of a word in a huge file (no coding - just high level explanation). The first phone interview was just a series of high level questions.
0 kommentar(er)
