Author Archives: Stanislav_Panteleev

example

here is the illustration, step by step code:

LSB – least significant beat, most right bit MSB – most significant bit, most left bit code below shows if there is a bit in k position from leeast significant bit

// this is one of the brilliant problems of binary search on leetCode, the main idea to realize that fractions are in [0, 1) range As usually g function here is the function which for values >= mid returns true, … Continue reading →

// convert chart to int isPalindrome

Interesting observation ! looking at leetcode tests with different algos, looks like for in with iterator inside works faster than for i

another example

To Everyone using nums[ i ] % 2 == 0 to check for even element. Use bitmask to determine even numbers which is fast computation wise.( nums[ i ] & 0x1 ) == 0 instead of nums[ i ] % 2 == 0

Example