https://github.com/randhir200/number-of-occurences-in-logn

You are given n different numbers and an integer k. Write a program that finds number of times k is present in log(n) time complexity. NOTE: YOU MUST NOT USE BRUTE FORCE SOLUTION WE KNOW THAT YOU KNOW BRUTE FORCE SOLUTION AND WANT YOU TRY THE LOGN SOLUTION
https://github.com/randhir200/number-of-occurences-in-logn

Last synced: 1 day ago
JSON representation

You are given n different numbers and an integer k. Write a program that finds number of times k is present in log(n) time complexity. NOTE: YOU MUST NOT USE BRUTE FORCE SOLUTION WE KNOW THAT YOU KNOW BRUTE FORCE SOLUTION AND WANT YOU TRY THE LOGN SOLUTION

• Host: GitHub
• URL: https://github.com/randhir200/number-of-occurences-in-logn
• Owner: Randhir200
• Created: 2022-07-16T15:39:14.000Z (over 2 years ago)
• Default Branch: master
• Last Pushed: 2022-07-16T16:07:26.000Z (over 2 years ago)
• Last Synced: 2024-11-06T03:46:56.285Z (about 2 months ago)
• Language: JavaScript
• Size: 0 Bytes
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:

Awesome Lists containing this project