某家NYC hedge fund面試題目分享

看板Oversea_Job (海外工作)作者OverseaJob.時間17年前 (2008/02/07 00:49)推噓3(3推 0噓 3→)

留言6則, 4人參與討論串1/1

跟紐約一家做quantitive analysis的公司面試題目滿簡單的時間限制是兩個小時版上的強者大概一小時不到就可以ko吧可惜不能用perl寫字串用perl處理更快 Problem 1 The sentence "A quick brown fox jumps over the lazy dog" contains every single letter in the alphabet. Such sentences are called pangrams. You are to write a method getMissingLetters, which takes a String, sentence, and returns all the letters it is missing (which prevent it from being a pangram). You should ignore the case of the letters in sentence, and your return should be all lower case letters, in alphabetical order. You should also ignore all non US-ASCII characters. The code you submit must contain a method that conforms to the expected method signature, as follows: Java Definition Public Class: MissingLetters Method signature: public String getMissingLetters(String sentence) C++ Definition Function signature: string getMissingLetters(const string& sentence) C Definition Function signature: char *getMissingLetters(const char *sentence) Here the return value is a dynamically allocated string, which can be free'd using free(result). If the function fails because it cannot allocate memory it should return NULL. Examples: (Note that in the examples below, the double quotes should not be considered part of the input or output strings.) 0) "A quick brown fox jumps over the lazy dog" Returns: "" (This sentence contains every letter) 1) "A slow yellow fox crawls under the proactive dog" Returns: "bjkmqz" 2) "Lions, and tigers, and bears, oh my!" Returns: "cfjkpquvwxz" 3) "" Returns: "abcdefghijklmnopqrstuvwxyz" Problem 2 A collection of particles is contained in a linear chamber. They all have the same speed, but some are headed toward the right and others are headed toward the left. These particles can pass through each other without disturbing the motion of the particles, so all the particles will leave the chamber relatively quickly. You will be given the initial conditions by a String init containing at each position an 'L' for a leftward moving particle, an 'R' for a rightward moving particle, or a '.' for an empty location. init shows all the positions in the chamber. Initially, no location in the chamber contains two particles passing through each other. We would like an animation of the process. At each unit of time, we want a string showing occupied locations with an 'X' and unoccupied locations with a '.'. Create a class Animation that contains a method animate that is given an int speed and a String init giving the initial conditions. The speed is the number of positions each particle moves in one time unit. The method will return an array of strings in which each successive element shows the occupied locations at the next time unit. The first element of the return should show the occupied locations at the initial instant (at time = 0) in the 'X', '.' format. The last element in the return should show the empty chamber at the first time that it becomes empty. Java Definition Class: Animation Method: animate Method signature: public String[] animate(int speed, String init) Your method should be public C++ Definition Function signature: vector<string> animate(int speed, const string& init) C Definition Function signature: char** animate(size_t* steps, int speed, const char* init) If you choose to implement the C definition, you must allocate memory in the function animate and return the result as an array of char *. You should also place the length of the array in "steps". The allocation should be done in a way that the caller can: for (size_t i = 0; i < steps; i) free(result[i]); free(result); to free the storage you allocated, without memory leaks. The function should return NULL if it fails to allocate memory. You may assume the following constraints: - speed will be between 1 and 10 inclusive - init will contain between 1 and 50 characters inclusive - each character in init will be '.' or 'L' or 'R' Examples (Note that in the examples below, the double quotes should not be considered part of the input or output strings.) 0) 2, "..R...." Returns: { "..X....", "....X..", "......X", "......." } The single particle starts at the 3rd position, moves to the 5th, then 7th, and then out of the chamber. 1) 3, "RR..LRL" Returns: { "XX..XXX", ".X.XX..", "X.....X", "......." } At time 1, there are actually 4 particles in the chamber, but two are passing through each other at the 4th position 2) 2, "LRLR.LRLR" Returns: { "XXXX.XXXX", "X..X.X..X", ".X.X.X.X.", ".X.....X.", "........." } At time 0 there are 8 particles. At time 1, there are still 6 particles, but only 4 positions are occupied since particles are passing through each other. 3) 10, "RLRLRLRLRL" Returns: { "XXXXXXXXXX", ".........." } These particles are moving so fast that they all exit the chamber by time 1. 4) 1, "..." Returns: { "..." } 5) 1, "LRRL.LR.LRR.R.LRRL." Returns: { "XXXX.XX.XXX.X.XXXX.", "..XXX..X..XX.X..XX.", ".X.XX.X.X..XX.XX.XX", "X.X.XX...X.XXXXX..X", ".X..XXX...X..XX.X..", "X..X..XX.X.XX.XX.X.", "..X....XX..XX..XX.X", ".X.....XXXX..X..XX.", "X.....X..XX...X..XX", ".....X..X.XX...X..X", "....X..X...XX...X..", "...X..X.....XX...X.", "..X..X.......XX...X", ".X..X.........XX...", "X..X...........XX..", "..X.............XX.", ".X...............XX", "X.................X", "..................." } -- Oversea_Job 海外工作版匿名ID: OverseaJob 禁止轉錄本帳號所發表之文章!! -- ※ 發信站: 批踢踢參(ptt3.cc) ◆ From: 127.0.0.1