You need to log in or create an account to post to this user's Wall.
Thanks 1337 for the hint. I read all the post above and used the test cases from @windy ‘s github code.
Please replace map/set with hash_map/hash_set in the following code, and the algorithm returns in O(n^2) […]
nancylin joined the group Google Interview 1 year, 3 months ago
i suggest loser tree…
nancylin joined the group Facebook Interviews 1 year, 6 months ago
Could you give more details on ‘backtracking’?
My idea is to have a queue
1. push e, 3 into queue
2. pop all values from queue, append the next character, and push them back into queue (ea, e@, 3a, […]nancylin became a registered member 1 year, 6 months ago
