My software development journey
Given the base and exponent, how do we implement the pow(base,exp) function efficiently? For example pow(2.0,5) = 32 pow(0.4,2) = 0.16 pow(2.0,-2) = 0.25 For simplicity, let us assume that the base can be a decimal number and exponent can be any integer. A straight forward implementation that comes to mind is simply multiplying the…
Given an array of distinct numbers, how do we count the number of triplets with given sum? For example let us consider the array {5, 2, 7, 8, 4, 3} and the sum is 14, There are 3 triplets with the given sum(2,5,7)(2,4,8)(3,4,7) A brute-force algorithm will take O(n3) time. But this problem can also be…
Given an array of numbers, Count the number of pairs with sum less than or equal to K For example consider the array {5, 1, 12, 3, 6}, pairs with sum <= 10 are {(1,3), (1,5), (1,6), (3,5), (3,6)}. So there are 5 pairs with the given constraint. In one of the previous posts, we…
Given two sorted arrays of size M and N, Find a sequence of elements from both the arrays whose sum is maximum. The sequence can begin with any of the two arrays and can jump from one array to another array if there is a common element. Let us consider the following exampleArray1 = {1,…
Given an array of positive and negative numbers(distinct), How do we find the length of the longest consecutive subset? For example consider the below array {3, 6, 1, 2, 5, 7, 8} It contains {5,6,7,8} as the longest consecutive subset. So the answer is 4. Similarly for {2, 4, 6, 8}, the answer is 1…
Given an array of distinct numbers, we have to find if there is any triplet of type (A[i], A[j], A[k]) such that A[i] < A[j] < A[k] and i < j < k. For example consider the array {6, 1, 5, 2, 4} We have a triplet {1, 2, 4} which satisfies the given criteria.…
Given an integer, write a program to clear the right most set bit in it’s binary representation. For example, consider a number 54. It is represented in binary as 1 1 0 1 1 0. The right most set bit is marked in bold. We need to convert this to 1 1 0 1…
Given a single linked list, and an integer k, we need to reverse the linked list in groups of size k. For example consider the following diagram of input and output linked lists for k = 3. There are no tricks involved in the solution for this problem. It is just an implementation challenge where…
How to check if the given number is a Fibonacci number? A Fibonacci series starts with 0, 1. Remaining elements are formed by adding previous two numbers. Here are a few Fibonacci numbers 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,… If a number is given, a straight forward way to check if…
Given an array of numbers, find an index such that the sum of numbers to the left is equal to the sum of elements to it’s right. If there are no elements to the left or right, the sum is considered to be zero.This problem is from Hackerrank. Click here to solve this problem on…