Log in to Facebook to start sharing and connecting with your friends, family and people you know.

In this video, I have explained hackerrank angry professor solution algorithm.
hackerrank angry professor problem can be solved by using one for loop. The complexity of angry professor hackerrank solution is O (n). This hackerrank problem is a part of Practice…

Lonely integer hackerrank problem can be solved easily by using bit manipulation technique. The complexity of lonely integer hackerrank solution is O (n). This hackerrank problem is a part of Practice | Algorithms | Bit Manipulation| Lonely integer hackerrank…

In this video, I have explained hackerrank cats and a mouse solution algorithm.
hackerrank cats and a mouse problem can be solved by comparing relative distances of cats from the mouse. The complexity of cats and a mouse hackerrank solution is O (1). This…

In this video, I have explained hackerrank compare the triplets solution algorithm.
hackerrank compare the triplets problem can be solved by using ternary operator. The complexity of compare the triplets hackerrank solution is O (1). This hackerrank problem…

Birthday cake candles hackerrank problem can be solved easily by using one for loop. The complexity of birthday cake candles hackerrank solution is O(n) which is a part of Practice | Algorithms | Warmup | Birthday cake candles hackerrank challenge.

This…

🔴 Subscribe here: https://www.youtube.com/channel/UCx1hbK753l3WhwXP5r93eYA?sub_confirmation=1

Do you wanna get a job in Big product base companies ?? but do not know what to do?
These companies look for some mandatory skills in candidates before hiring which…

In this video, I have explained hackerrank time conversion solution algorithm.
hackerrank time conversion problem can be solved by applying string operations. The complexity of time conversion hackerrank solution is O (1). This hackerrank problem is a part…

In this video, I have explained hackerrank counting valleys solution algorithm.
hackerrank counting valleys problem can be solved by considering upward movement. The complexity of counting valleys hackerrank solution is O (n). This hackerrank problem is a…

In this video, I have explained hackerrank number line jumps solution algorithm.
hackerrank kangaroo problem can be solved by using set data structure. The complexity of kangaroo hackerrank solution is O (1). This hackerrank problem is a part of Practice…

Sherlock and Array hackerrank problem can be solved easily by deriving a linear equation. The complexity of Sherlock and Array hackerrank solution is O(n) which is a part of Practice | Algorithms | Search | Sherlock and array hackerrank challenge.

This video…

In this video, I have explained hackerrank drawing book solution algorithm.
hackerrank drawing book problem can be solved by using mathematics. The complexity of drawing book hackerrank solution is O (1). This hackerrank problem is a part of Practice | Algorithms…

Save the prisoner hackerrank problem can be solved easily by using modulo operator. The complexity of hackerrank Save the prisoner solution is O(1) which is a part of Practice | Algorithms | Implementation | Save the prisoner hackerrank challenge.

This video…

In this video, I have explained hackerrank find digits solution algorithm.
hackerrank find digits problem can be solved by using modulo operator. The complexity of find digits hackerrank solution is O (len(d)). This hackerrank problem is a part of Practice…

You must know how prefix sum algorithm can help you to improve the performance of your code.
This video explains the need of prefix sum algorithm that why you must learn prefix-sum algorithm.
This is the first part of the video and don’t forget to watch the…

Prefix sum algorithm is mainly used for range query and the complexity of prefix sum algorithm is O(n).
This video explains the working of prefix sum algorithm.
This is the second part of the video and please watch the first part (why you must learn prefix…