↳
What other types questions were on the written test?
↳
Given a scnerio, create a database model
↳
How to improve performance?
↳
Use a counter to track the status. Stack solution is no difference from this. Seeing an opening parenthesis increment the counter. Seeing a closing parenthesis decrement the counter. Check the counter is always non-negative. Counter has to be zero when string ends. Moins
↳
Stack the parenthesis up. 1st of course the first parenthesis will go on to the stack. If you see a closing parenthesis, pop the stack and see if the parenthesis matches the one which is just read(closing one), if no match? error else keep going. Moins
↳
To Aegis: If you take "[" as 1 and "]" as -1, then ][][ starts from -1. We can say that's invalid right away. Moins
↳
1. 1000 computers - parallel 2. the problem can be divided into 2 parts. (1) find the top 1000 numbers from that 1 billion numbers in one computer To do this. we just need to use merge sort. Everytime use the left part. With some calculation, the solution for this is actually O(N). n is 1 billion. (2) get that top 1000 from the 1k * 1k list. (easy) Moins
↳
There is a very nice parallel sorting algorithm with a very good iso-effeciency. It is called Sample-sorting. I would use that. Moins
↳
You could do a bunch of crazy stuff too... Map reduce and parallel stuff is kinda a given. You'd be reading in strings, so before converting them to numbers, you could just check the position of the comma/point, and skip if your comma/point counter is at a higher value. If there's a minus sign in the beginning ignore the number, provided you already have 1000 positive numbers. Do something crazy with a stream and a router. Write a HD driver that scans the sign bit and exponent bits. lol Find a way to scan vertically for the comma/point. And you wouldn't be sorting you'd be searching. Ideally, it would take as long as it takes to read 1 text file from disk, because you'd be kinda faux streaming it through your code, plus a little extra time, multiplied by the number of files. You'd get a nice boost from dividing your file by the number of processors. 32 cores = 32 pieces of file being processed at the same time. Moins
↳
They will mail the exact date. The joining date is between 6-16 aug. The difficulty of 2nd round was medium. One question was a bit difficult and the rest were medium.If you are good at coding and regularly doing it then you can easily crack it. Moins
↳
Be sure you are good at coding.
↳
when is your joining??what is the difficulty of 2nd round?
↳
This ridiculous, senseless question was the first one asked. It set the tone for what was to follow. Moins
↳
IDE, Build Tools, Version Control!
↳
Git, Codio, and Netflix
↳
A callback function is a piece of JavaScript code that executes after the main function that the callback is attached to executes successfully. Moins
↳
udaykanth, I would say that a .forEach() would be the most common and most basic use of a callback function. I'm just writing this to help anyone that might have a hard time thinking up a quick example if the come across this question themselves. Example: var numArray = [ 1, 2, 3 ] ; numArray.forEach( function( i ) { console.log( arr[ i - 1 ] ) } ) ; // logs out // 1 // 2 // 3 Moins
↳
I don't think Bloomberg is a very good company. I am an excellent web developer and have gotten multiple offers from other companies with big names, but was rejected by Bloomberg. They are too demanding during the job interview and it becomes a game of how well you can interview as opposed to how talented an employee you are and how much you can contribute to the growth of the company. Moins
↳
Could you please tell us what can be the expected salary for 4-5 years of experience candidate. Moins
↳
Do you know what is the salary band for PM?
↳
How much salary did they offer you?
↳
def reverseNoDuplication(s): m = len(s) for i in range(m - 1, -1, -1): if s[i] not in s[m:]: s.append(s[i]) return s[m:] Moins
↳
var arr = [1,2,3,4,5,6] for i in 0..
↳
var arr = [1,2,3,4,5,6] for i in 0..
↳
Yes, working with other teams will help you to make the goal easily
↳
Ok..
↳
Ok..
↳
Can you please say something about the task?
↳
I've coded on the inverview while sharing my screen. They asked specific language questions and other technologies around it. Moins
↳
Can you please tell which task they gave to you during the interview, would be very helpful. Moins