My software development journey
This is a problem from Codeforces. Please follow this link to solve this problem on your own. The abridged problem statement is as follows. You are given an list of numbers, and sub-list size as input. The challenge is to find a sub-list such that the difference between the maximum and minimum numbers in that…
Given an array numbers, we have to join them in such a way that it forms the biggest number. For example consider the simple three element array [10,3,2], they can be joined in following ways 1032, 1023, 2103, 2310, 3102, 3210. Among these numbers 3210 is the biggest number. To solve this problem we definitely…
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 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…
There are some gas stations arranged in a circle. Each of them has some amount of gas. We are also given the distances between all the consecutive stations. Assume that we have a vehicle with very large fuel tank(infinite) and one unit of gas is needed to cover one unit of distance, the problem is…
Given an array of positive and negative numbers, find the maximum sum of any sub sequence such that no two elements are contiguous.For example consider the array {3,-2, 1, 7}, maximum sum is 10 for {3,7}For {3,-2, 1, 0, -4, 2} it is 6 for {3,1,2}This problem can be efficiently solved in O(n) time using…