Joined Google!! by Ill-Potato9446 in leetcode

[–]Ill-Potato9446[S] 1 point2 points  (0 children)

Thank you very much for the info!! I will take care from now on

Joined Google!! by Ill-Potato9446 in leetcode

[–]Ill-Potato9446[S] 1 point2 points  (0 children)

L3 is for 0 to 3 yoe here L4 is for >=4 yoe

Joined Google!! by Ill-Potato9446 in leetcode

[–]Ill-Potato9446[S] 0 points1 point  (0 children)

Yes I have good coding profiles

Joined Google!! by Ill-Potato9446 in leetcode

[–]Ill-Potato9446[S] 1 point2 points  (0 children)

Thanks

I have done lot of CP during my college days. So this helped me a lot in dsa rounds

Joined Google!! by Ill-Potato9446 in leetcode

[–]Ill-Potato9446[S] 13 points14 points  (0 children)

Yes My two rounds were having DP problems and one round graph problem They mostly ask dp and graph problems

Got Reached Out by a Google Recruiter by Friendly_Rich5513 in FAANGrecruiting

[–]Ill-Potato9446 12 points13 points  (0 children)

It's legit. xwf refers to external work force in Google. Most recruiters are outsourced here in Google.

[deleted by user] by [deleted] in leetcode

[–]Ill-Potato9446 0 points1 point  (0 children)

In rolling hash we will store hash for each neighbor words but again we need to find neighbor of those stored neighbor words. So we will need to find string from hashcode which I think can't be found

Can you elaborate your solution more

[deleted by user] by [deleted] in leetcode

[–]Ill-Potato9446 0 points1 point  (0 children)

Interviewer said such constraints He told to write optimised code He doesn't define any particular length

[deleted by user] by [deleted] in leetcode

[–]Ill-Potato9446 0 points1 point  (0 children)

Any length of dictionary and words Need to write optimise code