Tip 1 : Focus more CS Fundamentals and understand the foundation concepts
Tip 2 : Practice lots of Competitive Programming Problems and improve your problem solving skill
Tip 3 : Focus on development, try building a complete application and update your resume with minimum of 2 projects you have done.
Tip 1 : Add minimum of 2 development projects
Tip 2 : Highlight your skills and 1 page resume is appreciated
Interview was at Office. There were two interviewers and they were so friendly.
Interviewers covered all the fundamentals of CS questions and questions on DS



I already practiced this, so it was easy for me to solve.
Have a visited flag with each node.
Traverse the linked list and keep marking visited nodes.
If you see a visited node again then there is a loop. This solution works in O(n) but requires additional information with each node.
A variation of this solution that doesn’t require modification to basic data structure can be implemented using a hash, just store the addresses of visited nodes in a hash and if you see an address that already exists in hash then there is a loop.




The area of the largest square submatrix with all 1s is 4.
Solved with Dynamic Programming
Asked to write Queries providing some use-cases .
Expected to write with Joins, GroupBy and OrderBy
Tip 1 : Practice to write queries with Joins
How Primary Key in DB works internally and how will you implement that with code ?
How JVM works ?
Implementation of Tic-Tac-Toe game
Have solved with Brute-Force Approach.
Interviewer then asked to optimise and the interview went for next 1 hour for optimising to least time complexity.
Culture Round
Asked about Long Term Goals
Asked about Long Term Goals, Strengths, Attitude.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?