My software development journey
We all know that while executing a program, they store their data in memory. Memory can assumed as a large array of bytes. The endianness of the machine indicates in which order the data gets stored in the memory. Please refer this and this link for a detailed introduction to this topic. Here is the…
Given an array of positive and negative values. We have to find the maximum sum a sub-array can have. For example the the array {-1, 7, -2, 4, -3, -9, 2} has a maximum sum of 9 which corresponds to the sub-array {7, -2, 4}. To solve this problem, we take two variables to keep…
Given an array of numbers which contains all the numbers in pairs expect one element. We have to find that unique element. For example in the array [7,3,8,1,3,4,7,1,8] 4 is the unique element and all the remaining elements occur in pairs. This is actually a specific case of more generic problem discussed in the my…
Given a set of numbers, how do we generate its power set? For example for the set {1,2} the power set is given below. { {}, {1}, {2}, {1,2} } A power set is nothing but all the possible subsets of a given set. If a set contains N elements, it’s power set contains 2N…
Given an array of numbers which indicates the prices of stocks for a period of time. We have to find the two values in the array such that their difference is maximum and also the greater value must appear later than smaller value. In another way, we have to find the buying and selling price…
Given a Binary Search Tree (BST), How do we find the Lowest Common Ancestor (LCA) of the given two nodes? For example in the following BST, the LCA of 5 and 8 is 7 because it is the nearest ancestor common to both the nodes. Let us assume that the LCA(5,7) is 7 itself (…