Forum Posts
- 6 Answers How (badly) did my technical interview go? (Facebook)
I've had a screening interview and a technical interview at Facebook. The screening interview went great, the technical interview not as well. I've yet to hear back from Facebook and probably won't for another week, but in the meantime I'm trying to figure out how badly I did.
- Daniel Smith January 24, 2015
I was asked one question, not a simple "reverse a linked list" question, but not "implement this esoteric algorithm." It was my first technical interview. The short story: I spent the whole time on one problem, which isn't terrible in and of itself, and missed a much easier solution. I think I showed solid thought process and understanding in other ways though.
Long story: In normal interviews, you don't want to leave any silence. For some reason, this being my first technical interview, I had the same instinct. I kept talking so much about my thought process that instead of thinking critically about it, my brain just went into auto-pilot. I think I was pretty clearly nervous.
I'm a college Freshmen, but I have a pretty impressive resume. I've been programming all sorts of projects since middle school. I genuinely believe that I am qualified for the internship program. I've done an enormousness amount of program (much more than some college comp. sci seniors). The Facebook recruiter was really enthusiastic about my resume.
So, be honest, how screwed am I? What are my chances of getting a second technical interview? (I think I'd do much better)| Flag | PURGE - 1 Answer C# MCQ Morgan Stanley
Which among the following statements are correct about delegates?
- learninggeeks January 23, 2015
1. Functions called using delegates are always late bound.
2. Delegates are type safe
3. Delegates are wrappers for function pointers
4. The declaration of the delegate must match the signature of the method it points to
5. Without inheritance delegates cannot be used.| Flag | PURGE - 0 Answers Phone interview with Amazon, interviewer is the Hiring Manager
I'm going to have my second phone interview with Amazon next week, and I was informed that the interviewer has been changed from one of the developers to the hiring manager. Has anyone had a similar experience? Is the interview going to be any different from any others at all?
- sean January 21, 2015| Flag | PURGE - 0 Answers How to design site like junglee.com
There is a design question that was asked in an interview.
- sh January 12, 2015
geeksforgeeks.org/amazon-interview-experience-set-160-sde-2
The question is : "Design a site similar to junglee.com. Assume you are given a crawler, design a distributed system , what data structure will you use , some basic api’s etc."
Can someone guide how to think step by step for design problems like these.| Flag | PURGE - 0 Answers Design WYSIWYG editor
There is a design question that was asked in an interview. geeksforgeeks.org/amazon-interview-experience-set-160-sde-2
- sh January 12, 2015
The question is : "Design a site similar to junglee.com. Assume you are given a crawler, design a distributed system , what data structure will you use , some basic api’s etc."
Can someone guide how to think step by step for design problems like these.| Flag | PURGE - 1 Answer Cracking the Code -- Recursive Tree + Graph answers
I'm reading through cracking the code and I noticed that all of the Tree and Graph coding challenges were answered recursively. I was wondering why, and what is the advantage of doing this? I was under the assumption that recursive answers for Trees and Graphs was a bad idea due to stack overflows. Similarly, do you guys generally answer Tree and Graph related questions in a recursive fashion during interviews?
- Void_Massive January 05, 2015
~Best| Flag | PURGE - 1 Answer How to implement Prefix Tree in Java
Hi ! I want to implement Apriori Algorithm of Data Mining using Prefix Tree (Trie). So the problem is how to implement Prefix Tree. I want to insert in it the combination of strings and to check a combination of strings is found in tree or not. Thanks in anticipation.
- Sudhakar Singh January 03, 2015| Flag | PURGE - 1 Answer Solution to 9.7, Cracking the Coding Interview
In the solution to exercise 9.7, there's a comment in the solution that "we have potentially 1 million functions on the call stack after going just 10 pixels away." Why is this, and how does this "work?" I understand there's a branching factor of 4, and 4^10 is ~1 million, but as far as I know we only add to the call stack one function at a time.... so why would the branching factor be an issue?
- foxjas09 January 03, 2015| Flag | PURGE - 0 Answers Refer: Jave developers
Asurion, the global leader in mobile device and data protection serving 280 million (and rapidly ++) customers, is looking for talented engineers who can excel, in a dynamic and diverse environment, building our next generation products and solutions of extreme scalability and performance:
- Anonymous December 29, 2014
- CS degree preferred
- Solid algorithm and coding skills
- Strong Java (Concurrency, JVM, GC, JUnit, Profiling, etc)
- Experience in Java EE, Spring, JBoss, etc
- Experience in database, cloud, etc
If interested and qualified please contact j6eedev@gmail.com. Thanks.| Flag | PURGE - 1 Answer longest decreasing sequnce of even numbers
OK HERE is my problem:
- hushloly December 23, 2014
Let us consider a list a1,a2...an of integer numbers.Determine a longest decreasing sequence ai1,ai2..ajk consisting only of even numbers.Example: for the list 13,52,17,16,50,9,18,3 the solution is 52,50,18.(I really don t know if it's 100% "ai1...ajk"; I discovered in a book with very small writing but I think you have caught the idea).
I don't have to implement it, just to indicate the most appropiate programming method(greedy,dynamic programming,divide et impera,backtracking) that can be used for solving it and to justify the method's applicability and analyse the problem solving according to the particularity of the selected programming technique.
I've read some things on the internet and I've found that the programming method used in the problems like that is dynamic programming but this is all.
If anyone can give me some advices please share with me.Thank you!| Flag | PURGE - 0 Answers cryptarithamatic best questions
cryptarithmetic.in
- pandikoku000 December 22, 2014
good questions| Flag | PURGE