python (12.9k questions)

javascript (9.2k questions)

reactjs (4.7k questions)

java (4.2k questions)

java (4.2k questions)

c# (3.5k questions)

c# (3.5k questions)

html (3.3k questions)

Questions - binary-search

C# problems getting results from List<T> BinarySearch with duplicates in the first and last position

I'm playing around with different implementations for the most simple of the LeetCode problems TwoSums. I have various other ways working fine using methods like indexof, Dictionary searches, brute fo...
test-img

cjf-f3

c#

binary-search

Votes: 0

Answers: 2

Latest Answer

Yes, you have a special case target / 2 + target / 2 == target when you check for two items each of which are target / 2: public int[] TwoSum(int[] nums, int target) { // Comment out if nums is alre...
test-img

Dmitry Bychenko

Getting a timeout with Big Numbers

I was solving CodeWars task(https://www.codewars.com/kata/5e4bb05b698ef0001e3344bc/train/csharp) and faced a problem. In it you are given the array of numbers, which length is multiply of 4, you need ...
test-img

Iceneo

c#

loops

binary-search

Votes: 0

Answers: 1

Latest Answer

To avoid to waste time to build the list of square number and/or to have an out of memory exception, you just test directly if the big number is the sum of 2 square number like this : (its basic solu...
test-img

Frenchy

Present Sequence as a sum of 2 squares

I was solving a CodeWars task and faced a problem. In it you are given the array of numbers, which length is a multiple of 4, you need to visualise it as a (x1^2 + x2^2) * (x3^2 + x4^2) .... * (xn^2 +...
test-img

Iceneo

c#

loops

binary-search

Votes: 0

Answers: 1

Latest Answer

it seems your error is coming from this line: for (int i = 0; i <= (int)Math.Sqrt((double)sequenceSum + 1); i++) list.Add(BigInteger.Multiply(i , i)); you have to use Bigintege...
test-img

Frenchy

Binary search program cause runtime error and failed hidden test cases

I am practicing binary search with problem 704 on leetcode. At first, I just follow the concept of binary search and came up with this solution: int search(int* nums, int numsSize, int target){ si...
test-img

Steven

arrays

c

binary-search

arrays

c

binary-search

Votes: 0

Answers: 2

Latest Answer

The only thing wrong with your second implementation is using size_t. Change it to int, and it ought to work fine. size_t is an unsigned type. The value of end can be negative when the search is probi...
test-img

Gene

Posts

Questions

Blogs

Jobs