nikhila01

5 ms·

1. 1.▲
   by nikhila01 4y ago

   Thanks for taking the time to read and respond. I admit the second paragraph of my post was a bit aggressive and I was on the fence about posting it. I don't have a problem with you sharing your background but the parts I mentioned pre
2. 2.▲
   by nikhila01 4y ago

   MIT's discrete math course [1] is listed as a prerequisite for the algorithms course so Problem Set 0 doesn't seem unreasonable in that case. Requiring an intro programming class and a discrete math class won't require you to
3. 3.▲
   by nikhila01 4y ago

   You should read about dynamic arrays more carefully. They have amortized O(1) insertion which is better than a tree, and the data is contiguous in memory which gives it better cache locality than a tree. They are one of the most popular dat
4. 4.▲
   by nikhila01 4y ago

   They were looking at IONQ+ which is what you get if you google IonQ. I guess those are the warrants. Google has the warrants as IONQ+ but Yahoo as IONQ-WT. - https://www.google.com/finance/quote/IONQ+:NYSE - http
5. 5.▲
   by nikhila01 4y ago

   Here's a version of the slides which also has notes: https://homes.cs.washington.edu/~tom/talks/edreform.pdf
6. 6.▲
   by nikhila01 5y ago

   I was curious too. Probably https://careers.jpmorgan.com based on his LinkedIn and the fact that he said "Careers Page redesign for one of the biggest banks in the world."
7. 7.▲
   by nikhila01 5y ago

   Which is why it's fine to challenge the comment. The commenter is implying a lot considering he doesn't have any inside knowledge of Adobe Sign. And even if you look at public data--esignatures being relatively new, Covid moving m