4 ms·
They have a list of all the questions you can go through, no sign in required. Not sure what you're talking about. http://www.interviewcake.com/all-questions h
by HeyItsJames 13y ago
They have a list of all the questions you can go through, no sign in required. Not sure what you're talking about.
http://www.interviewcake.com/all-questions http://www.interviewcake.com/all-questions
- obituary_latte 13y agoThat's great. Now, go to their homepage without being logged in and see if you can find a link anywhere to the all-questions page.
- binarycrusader 13y agoOnly by using "view source": <!-- <li> <a href="/all-questions">All Questions</a> </li> --> Note that they've commented out the link for some reason.
- obituary_latte 13y agoHrm. Maybe that's one of the interview questions.
- itsybitsycoder 13y agoHe's talking about the normal flow of the site (click the big blue button at the bottom of the first page, then the second page). This leads to a "Login with Github/Google/Facebook" prompt that can't be skipped. You can close it, but that doesn't get you anywhere.
- Splendor 13y agoI would guess that obituary_latte is talking about the fact that there's no link to the page you're referring to.
- bpicolo 13y agoWorst part is their max-stack isn't optimal. You can do it with O(1) additional space.
- gameguy43 13y agoHm. How?
- BHSPitMonkey 13y agoPlease explain. Without maintaining that ordering, you're going to have to iterate over the entire stack after every pop, no? One of their requirements was to keep pop() at O(1) rather than O(n).