Bloomberg Software Engineer interview questions

For the first phone interview, I didn't get the phone call. The reciter then set another one for me. The phone interview took an hour. The compiling function of the online coding tool went down so I have to talk through my code to the interviewer. However I have a feeling that when I was talking about the answers the interviewer was doing his own staff. I need to wait for a long time for his response and I even asked whether he is still there or not. Almost at the end of that interview, the interviewer seemed has done his own works and asked me whether I have any questions for him, then he answered my questions patiently. I got the onsite interview invitation the next Monday. They have a travel agent helped me to book the ticket and flight and hotel. However, they explained that since the non-stop air ticket is too expensive, they have to book me a 1 stop one. It is only 1 hour and 40 minutes from my city to the NY, however, since I have to stop in another airport and the first flight delayed which made me fail to catch the connecting flight, it took me 9 hours to go the NY city the day before the interview and when I went back this happened again. Well I will suggest them to book a Grey hound ticket for the candidates next time. When I finally arrived at the LGA airport, the taxi they have arranged took me to a wrong hotel. Luckily the wrong one is closer to their HQ and I decided to stay there. On the interview day, I only survived 2 rounds. The first round: 1. Signal processing questions on my resume. What is LDPC, FFT? 2. Return the index of the largest and second largest number of an given array 3. Return the occurrence of each letter of a given string in alphabetical order 4. If there is a people standing in the middle of a railway and there is a train from a unknown distance coming, there are two stations distanced 300m and 500m in two directions of the railway, he has to decide which direction he should run. The Second Round: 1. best time to buy and sell stock 2. brain teaser: two robot, same program make them meet each other without knowing their location and no communication between them. Solve it both in 1d and 2d 3. Two linked list joint together, find the node they first meet what if there is another list point to one of them, how to find the point which the two lists merge To sum up, the building is very nice but the travel experience was so unpleasant.