#!process kleiner perkins phone
fair prawn
U deserve it congrats
plush patio
was this the fellowship thing?
umbral vector
@languid gulch how’d you do on oa?
languid gulch
was this the fellowship thing?
yuh
what was necessary
||nah idk how i did on sys design i felt it was correct but who knows string problem i aced.||
languid gulch
<@976909831829061693> how’d you do on oa?
^
civic imp
I thought fellowship is only for full time position no?
umbral vector
what was necessary
||nah idk how i did on sys design i felt it was correct but...
O nice do u remember the solution for string problem
I kept tle on the last two test cases
Was doing expansion from the middle to find the palindromes
languid gulch
Was doing expansion from the middle to find the palindromes
sounds about right ??? do you remember the full question i i could maybe come up w same solution
i took oa same day it acme out so can't remember exact implementation
umbral vector
sounds about right ??? do you remember the full question i i could maybe come up...
ill dm
oh nvm doesnt let me
i think the question was smth liek this
find the number of substrings that are "perfect" palindromes, where "perfect" means that u can compress sequential letters that are equal
ex: bbab is a perfect palindrome because bb -> b, and bab is a palindrome
compression is not required, but can be done if needed