You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance between node ‘X’ and node ‘Y’.<...
Data Structures, Alogrithms, Dynamic Programming, Trees and Graphs, OOPS (not asked by Google), Operating System (not asked by Google).
Preparation Tip
Tip 1 : Be thorough with all the standard data structures and algorithms. Tip 2 : Give contests regularly on codeforces/codechef. Tip 3 : Practise famous interview problems from past.
Application Process
Where:
Campus
Eligibility:
Only students from circuital branches were allowed to apply.
Resume Tip
Tip 1 : Only mention the projects which you can properly explain to the interviewer. Tip 2 : Elaborate the work done by you in bullet points. Tip 3 : Try to keep the resume exactly 1 page long.
0 upvotes
Have an interview experience that you want to contribute?