Tip 1 : practice previous questions
Tip 2 : attend mock interviews
Tip 3 : make your resume with intresting projects
Tip 1 : make it short and attractive
Tip 2 : mention only your top 2 or 3 projects
For the array [ “TUNA”, “TIGER”, “RABBIT”, “RAT”, “ANTEATER” ],
A possible circle can be:
Example:
Consider the following Graph:
Vertices reachable from vertex 0:
0 -> 1 -> 3 -> 2 -> 4 -> 5 -> 7 -> 6
Vertices reachable from vertex 1:
1 -> 3 -> 2 -> 4 -> 5 -> 7 -> 6
Vertices reachable from vertex 2:
2 -> 1 -> 3 -> 4 -> 5 -> 7 -> 6
Vertices reachable from vertex 3:
3 -> 2 -> 1 -> 4 -> 5 -> 7 -> 6
Vertices reachable from vertex 4:
4 -> 5 -> 7 -> 6
Vertices reachable from vertex 5:
5 -> 7 -> 6 -> 4
Vertices reachable from vertex 6:
6 -> 4 -> 5 -> 7
Vertices reachable from vertex 7:
7 -> 6 -> 4 -> 5
Clearly, there is only one vertex “ 0 ” in the graph, from which all other vertices are reachable. Hence, vertex “ 0 ” is the mother vertex of the above graph.
There can be more than one mother vertices in a graph.
(a, b) -> (a + b, b)
(a, b) -> (a, a + b)
For the coordinates, source point = (1, 1) and destination point = (3, 5)
The output will be true as the destination point can be reached using the following sequence of moves:
(1, 1) -> (1, 2) -> (3, 2) -> (3, 5)
An array ‘B’ is a subarray of an array ‘A’ if ‘B’ that can be obtained by deletion of, several elements(possibly none) from the start of ‘A’ and several elements(possibly none) from the end of ‘A’.
Virtualisation
Scaling
Explaining projects
The diameter of a binary tree is the length of the longest path between any two end nodes in a tree.
The number of edges between two nodes represents the length of the path between them.
Input: Consider the given binary tree:
Output: 6
Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?