# Search Quotes

# #7666

1919

⚐ Report// During mathphys study hall, Naveen installs the nCage extension on Stav's computer // From log chat next period: Stav: https://en.wikipedia.org/wiki/Carath%C3%A9odory%27s_extension_theorem Stav: wait maybe don't click that Stav: it maybe gave me a Nicolas Cage-themed google extension

# #7464

1010

⚐ Report//Period 4 SRP Bosse: Make sure to be a good audience. Last period, not to name any names, but Mark Jung fell asleep. Bosse: To be fair, it was not a lively presentation. Haydn: Was it Schaffer's? Bosse: No, it was Naveen, his voice just lulls you to sleep.

# #7330

66

⚐ ReportKlein: Whenever I ask Naveen a question like "What is your favorite color?", he'd draw a sigma and stuff.

# #7224

1717

⚐ Report//Practicing interviews Stav: How many letter a’s are on our website? *steeples fingers* Naveen: Well, uh… the most common vowel is e, so.. if we assume that your website has 2000 characters, then… Bosse: (Starts clapping) Thank you two for the interview! //Another interview Daniel: A permutation of n elements is chosen uniformly at random. A partition of the permutation into contiguous blocks is correct if, when each block is sorted independently, the entire permutation becomes sorted. Find the expected value of the maximum number of blocks into which the permutation can be partitioned correctly. Kevin Qian: Nice job stealing a question from a math competition. Have you even solved this? Daniel: To be honest, Bosse: (Starts clapping) Thank you two for the interview!