Tip 1 : Practice as much problem as possible from Graph
Tip 2 : Try to understand how web works, what are the communication protocol and when should we choose one over other.
Tip 3 : Core subjects are must.
Tip 1 : Add projects (Full-stack will preferred more)
Tip 2 : Add some works experience and describe what you did there.
mcq from core subjects
What data structure we use for indexing? Can we use hashmap? What problem will occur if we use hashmap for indexing billion row table?
Tip 1 : We can use hashmap
Tip 2 : But when you will use hashmap for indexing billion row table then you might run into internall memory fragmentation issue as hashmap is contiguous.



V is the number of vertices present in graph G and vertices are numbered from 0 to V-1.
E is the number of edges present in graph G.
The Graph may not be connected i.e there may exist multiple components in a graph.
Hackathon for 7 hours where you have to make your solution for the previous round thread safe.
Technical Interview
Design Keyboard.

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