Longest Substring Without Repeating Characters in Rust
Given a string, find the length of the longest substring without repeating characters. ...
problem
Two Sum in Rust
What a great example of an interview question; there are a few levels of difficulty making the problem accessible to many, a fairly obvious naive O(n2) approach with an oportunity for optimisation, and the curious will find that you can do it in O(n) as well. If I ever run another tech interview training course I’ll probably break apart and analyse this problem with the class. It is, however, quite easy and not ideal for an actual interview....