#!process bloomberg r1 finished and
1 messages · Page 1 of 1 (latest)
Just one
was it dp
Completed fully but interviewer helped me for optimization of space complexity but couldn’t catch it
Was deepest sunstring
Interviewer K?
deepest substring?
It was from G
Question type deepeat substring from string
tagged?
trie problem?
I couldn’t find exact question on leetcode but found similar to that.
Yes kinda like that
how @analog oxide bomed if u solved it lmfao
hiring bar is high
optimal solution is expected
if u cant code then at least talk about it
and talk correctly
also hes given only 1 question
Exactly
but again, depends on interviewer
and how u communicate. thats it
just chill and focus on other companies
what was the question?
@analog oxide did they ask follow ups with that, or just one and done
wait so if (a,{{}}), would that print "" or "a"
like is that problem asking for deepest string or is it asking for the substring ini between the deepest brackets/parentheses
@analog oxide
depends on what do u consider to be valid parentheses here. if () are the only valid ones -> i think we should return a{{}}??
i think the problem on lc only have () not curly ones
if we consider both () and {} then empty string