2016-02-11-roman-drits-barnimages-003_small

Facebook Interview – Longest Substring Without Repeating Characters

This week, we’ll talk about question – longest substring without repeating characters.

If you are following our blog, you might notice that we start to provide coding solutions at the end of each question. At Gainlo, many people have the feeling that questions asked by Google/Facebook are much easier than they expected, but they still didn’t make it. The most common reason is that they failed to provide solid code in a short time.
(more…)

The post is written by Gainlo - a platform that allows you to have mock interviews with employees from Google, Amazon etc..

I'd like to learn more

Share on FacebookTweet about this on TwitterShare on LinkedInShare on Reddit

Read More