Consider this array: std::vector<int> numbers = { 0, 4, 12, 60, 89 }; It is sorted and only has positive numbers. What is the easiest way to find closest smaller number in the array, preferably from <algorithm>? Example: Number Result 0 0 3 0 15 12 74 60 150 89 >Solution : What is the… Read More How to find closest smaller number in array with C++?

I have the following problem: when writing a number, I get a big tail. I know it’s related with bits, but how do I avoid this tail? We can’t use native methods and concatenations, parseInt, parseFloat, Number and etc. function getNum(message) { const zero = "0".charCodeAt(0); const nine = "9".charCodeAt(0); const comma = ",".charCodeAt(0); let… Read More Get a number without "tail" using charCode

I’m currently working on implementing a token bucket algorithm in JavaScript to monitor the number of requests per second. The objective is to allow requests to proceed if there are sufficient tokens available in the bucket, otherwise, the system should enforce rate limiting. However, upon testing my code, I observed that it consistently outputs ‘false’.… Read More Implementing token bucket algorithm

For two numbers, lets say 5 (101) and 3 (011), what is the most efficient way to get every number that is a combination of the different bits in these two numbers. (i.e the solution would be 101, 011, 001, 111). The number of these is just 2^(# of bits different) which I can get… Read More Get every combination of bits for two binary numbers

I am trying to write a program in C that performs the merge sort algorithm on an array of integers. The code appears to run correctly and produces the right output, but when I run valgrind, I am informed of memory leak errors. Here is my code: #include <stdio.h> #include <stdlib.h> #include <math.h> int *merge(int… Read More Memory leak error in implementation of merge sort in C

I am trying to find the most efficient way to output an object of array having mismatching values only. Here are two object of arrays: var arrA = [ {Name: "A"}, {Name: "C"}, {Name: "F"}, {Name: "G"}, ] var arrB = [ {Name: "C"}, {Name: "J"}, {Name: "I"}, ] Here is the result I am… Read More how to compare two object of array and output mismatching values only?

It always returns empty array. Implement solution to two sum problem in javascript function twoSum(nums, target) { const map = {}; for (let i = 0; i < nums.length; i++) { let comp = target – nums[i]; if (map[comp] !== undefined) { return [map[comp], i]; } else { map[comp] = i; } } return [];… Read More two sum problem always returns empty array

I got the following Python assessment: There are N people, numbered from 0 to N-1, playing a game. The Kth person is assigned the letter S[K]. At the beginning the 0th person sends a message, consisting of a single letter S[0], to the A[0]th person. When the Kth person receives the message, they append their… Read More Message passing game algorithm in Python

I am writing a program that should split a string into groups of the same letter, then for each group it should count the number of uppercase and lowercase letters and multiply them together, then add the value for each group to a total for the entire string and output that total value. So for… Read More How do I fix the output from always displaying 0 in the console?