ALGORITHM (weight: 30%) A small directory is hard-coded as an array in the code: String names[] = { "Elon Musk", "Ken Howery", "Luke Nosek", "Max Levchin", "Peter Thiel" }; A requirement is to be able to extend this directory dynamically at runtime, without persistent storage. The directory can eventually grow to hundreds or thousands of names and must be searchable by first or last name. 1) What approach would you take? (Ans: HashMap) 2) Write an implementation for the add and search methods in pseudo-code using data structures you have in mind.

SQL (weight: 10%) Consider the table below: table A ( id integer primary key, name varchar(20), age integer ) Write a query to return the list of unique names from table A

CODING (weight: 50%) The string "PAYPAL IS HIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line by line: PAHNAPLSIIGYIR Write the code that will take a string and make this conversion given a number of rows: String convert(String text, int nRows); convert("paypalishiring", 3) should return "pahnaplsiigyir"