Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Solved with Greedy + DP
I had solved very similar problem before. So it was easy for me
For the given binary tree [1, 2,...
Solved using brute force. All test case passed. I had solved many problems with dfs on trees before.
I don't remember exact question, hard coded few visible test cases
What is virtual memory. What are its uses. Different OS related problems, Indexing
Tip 1 : Be to the point
Tip 2 : Don't use book language
Tip 3 : Use examples
What is javascript, its uses, server client problems.
Tip 1 : Be to the point
Tip 2 : Don't use book language
Tip 3 : Use examples
Compiler design related questions, differences between Python and C in very depth.
Tip 1 : Be to the point
Tip 2 : Don't use book language
Tip 3 : Use examples
Low level vs High level language, kernel related questions
Tip 1 : Be to the point
Tip 2 : Don't use bookish language
Tip 3 : Use examples