Skip to content

Instantly share code, notes, and snippets.

@jianminchen
Created February 18, 2018 19:52
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save jianminchen/bfcb04c1382e08862879710873564be1 to your computer and use it in GitHub Desktop.
Save jianminchen/bfcb04c1382e08862879710873564be1 to your computer and use it in GitHub Desktop.
Advice being an interviewer
Feb. 18, 2018 10:00 AM mock interview as an interviewer on smallest substring containing unique keys
The peer worked very hard and also very open to advice, took the hint. The peer wrote the algorithm
around 70 minutes including discussion, fixing all the bugs etc.
I like to share that I could not finish the smallest substring algorithm in my first five practice
on mock interview platform, in 30 minutes. I had different issues, but last 3 or 4 times I kept got
very good peer to help me, one is really good. Please take a look here, the peer helped me.
http://juliachencoding.blogspot.ca/2018/01/find-smallest-substring-containing.html
And the other one is also good, the peer helped me to pass all test cases in 30 minutes.
http://juliachencoding.blogspot.ca/search?q=find+smallest+substring
Just practice the same algorithm again and again, work on one thing a time.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment