Рет қаралды 81,026
connect with me: / umarnmuqthar
Try to solve this array question. (If you can solve this question in under an hour you have a fairly decent amount of logic.).
"If the 2nd smallest prime number in an array is less than 7, replace every prime number greater than 7 which has duplicates in it with 0. Then find the sum of the array."
Note: do this without sorting the array
Due to some internal issues I was asked to remove the study materials from this video.
I'm sorry. A developer should have the ability to research and find answers to his questions. I believe you get a complete picture of what brocamp is, so get going, do your own research and be an ultimate developer✌️