Forwarded from HackerRank Solutions
YouTube
How To Solve Counting Valleys HackerRank Problem
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…
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…
Forwarded from HackerRank Solutions
YouTube
Sherlock and Array HackerRank Solution
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…
This video…
Forwarded from HackerRank Solutions
YouTube
Save the Prisoner HackerRank solution [ Algorithm + Implementation ]
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…
This video…
Forwarded from HackerRank Solutions
YouTube
How To Solve Find Digits HackerRank Problem | HackerRank Solution
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…
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…
Forwarded from HackerRank Solutions
YouTube
Why You Must Learn Prefix Sum Algorithm? | Need of prefix-sum Algorithm | EP1
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…
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…
Forwarded from HackerRank Solutions
YouTube
Prefix Sum Algorithm | Prefix Sum Array | Difference Array | Range Sum QueryO(1) | EP2
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…
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…
Forwarded from HackerRank Solutions
Hello Coding Lover,
Most challenging problem in array category Array manipulation hackerrank problem explained.
This video became lengthy a bit but trust me you will learn something from this. so watch this video till the end and let me know if you have any doubts or better approach to solve this problem.
please leave a feedback on my video, if you like hit like button, if you do not like ,hit dislike button.
https://youtu.be/hDhf04AJIRs
Most challenging problem in array category Array manipulation hackerrank problem explained.
This video became lengthy a bit but trust me you will learn something from this. so watch this video till the end and let me know if you have any doubts or better approach to solve this problem.
please leave a feedback on my video, if you like hit like button, if you do not like ,hit dislike button.
https://youtu.be/hDhf04AJIRs
YouTube
Array Manipulation Hackerrank Solution | Difference Array | Range Update Query In O(1)
Array manipulation hackerrank problem can be solved by using prefix sum arrays or difference array. The complexity of array manipulation hackerrank solution is O (n+m). This hackerrank problem is a part of Practice | Data Structures | Arrays | Array manipulation…
Forwarded from HackerRank Solutions
YouTube
How To Solve Equalize The Array Hackerrank Problem
In this video, I have explained hackerrank equalize the array solution algorithm.
hackerrank equalize the array problem can be solved by using auxiliary array. The complexity of equalize the array hackerrank solution is O (n). This hackerrank problem is a…
hackerrank equalize the array problem can be solved by using auxiliary array. The complexity of equalize the array hackerrank solution is O (n). This hackerrank problem is a…
Hello All,
Linked in placement question--
Can you count the maximum number of consecutive 1s in binary representation of a number, without traversing the array?
This question is asked in linked-in placement and many more interviews.
I have tried my best to explain the solution of this question in more details.
https://youtu.be/bc7cxeDy308
Linked in placement question--
Can you count the maximum number of consecutive 1s in binary representation of a number, without traversing the array?
This question is asked in linked-in placement and many more interviews.
I have tried my best to explain the solution of this question in more details.
https://youtu.be/bc7cxeDy308
YouTube
Length Of The Longest Consecutive 1s In Binary Representation Of A Number | BitManipulation
In this video, I have explained efficient way to count maximum number of consecutive 1s in binary string.
Length of the Longest Consecutive 1s in Binary Representation can be solved by using bit manipulation. The complexity of consecutive 1s in binary numbers…
Length of the Longest Consecutive 1s in Binary Representation can be solved by using bit manipulation. The complexity of consecutive 1s in binary numbers…