These days, I have been asked by some questions in interviews. These are not quite difficult questions, but I suppose I didn’t behavior well. There are some reasons I think, and I have to improve it:
- I am not familiar with the simple and basic question so that I’m not very sure about the solution’s correctness and I have to review it again and again.
- My code is not so effienct and some of the interviewers had to remind me that. That’s really terrible but I think they are very nice to let me know that.
- My code is not so clean because I didn’t keep a clean mind that time. I suppose it’s kind of nervous that time though I didn’t realize that and I want to solve that problem too hurry. I need to relax my minds next time.
- What’s worse, I didn’t have nice communication with interviewers. Because of my bad English and bad preperation for interview. Sorry about that.
And below are some questions I have to review:
- How to realize a queue or stack using array or linkedlist
- Binary search and whenever mentioning the sorted array, I think it should come into my mind immediately the binary search
- Graph theory about the DFS and BFS
- What’s difference between .equals and == in Java
- Heap and stack in java
- Some detials and desing thoughts of my projects
- ood object oriented design principles (https://scotch.io/bar-talk/s-o-l-i-d-the-first-five-principles-of-object-oriented-design)
- The comparasion between the methods of shortest path (http://developer.51cto.com/art/201105/262170.htm)
- Hanoi (http://blog.csdn.net/zhutulang/article/details/7491390)
- Maze (http://baobaoyangzhou.blog.163.com/blog/static/11783125020104147195273/)
- The realization of DFS not using recursive (http://blog.csdn.net/lalor/article/details/6845788) which use stack