#!process google onsite done
glad pagoda
How did it went?
not sure, have you taken yours?
first question i got plus the follow ups optimally, misheard / interview misspoke on a vital part of the problem so i was telling up for like 10 mins but once i corrected that it was easy. 2nd question i got a working solution and explain work but it wasn’t optimal. It was a variation of longest increasing subsequence and optimal would’ve been O(N log N) but instead i did a graph solution that has a runtime closer to like N^2
gaunt epoch
Oh Okay, But seems like you did pretty well that's good!, afaik if you solve and communicate clearly than that's a green signal
Not yet, have mine in like 20 days
frigid crypt
@glad pagoda would you mind sharing what your first question was on?
glad pagoda
<@801559983040757820> would you mind sharing what your first question was on?
graph and tree
frigid crypt
graph and tree
ahh okay thank youu, was the input for graph adj list or nodes or idk, u don't have to say either hahah
glad pagoda
adjList but it wouldn’t have really mattered