Tip 1 : Think from very basic level for LLD
Tip 2 : Think from very basic level for HLD
Tip 1 : You should have knowledge of your project from a holistic point.
Tip 2 : Don't put the skills on which you haven't worked on.
Input: 'arr' = [1, 1, 4, 5]
Output: 3
Explanation: The possible ways are:
[1, 4]
[1, 4]
[5]
Hence the output will be 3. Please note that both 1 present in 'arr' are treated differently.
solved both the questions
1. The given graph is never empty and consists of at least 3 nodes with the colour Red, Green and Blue each.
2. There are no self-loops(an edge connecting a node to itself) in a graph.
3. There are no parallel edges i.e no two nodes are directly connected by more than 1 edge in the given graph.
4. The nodes in the graph are numbered from 1 to V.
5. All the edges in the graph are bidirectional.
6. You can stay at one node for more than 1 second as well, but every second you stay there you will get an additional colour ball of the colour of that node.
7. Number of edges(E) in the graph is always equal to V-1.
8. You can also collect the ball from the destination and the source node itself. Also if you reach the destination without having an equal number of balls for each colour, the time calculated would not be valid.
Design Parking Lot
Requirement
1) Ticket should be issued at time of entry
2) Ticket will contain slot information
3) At exit, I need to calculate the price
4) Payment Integeration/ Modes
Design Online Multiplayer Game for Ludo.
And then the low level design of same.
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?