My software development journey
Given an array of N elements, the majority element is defined as the one which occurs more than N/2 times. One simple approach is to find the mode (which appears for most number of times) and check if its frequency is greater than N/2. Three strategies for finding the mode are discussed in my previous…
Given a string, how do we reverse the words inside the string? For example if the input string is “this is a test” the output should be “test a is this”. The algorithm is simple. This can be done in two steps. The first step is to reverse the entire string. In the second step…
Given a sorted linked list, how do we insert data into the list in proper order? This is nothing but a step in insertion sort. Simply iterate through the elements to find the position for given number and insert at that position. Here is the Java code to do that. I have used the LinkedList…
Given a string and a character, Write a function to remove all instances of the character and return the modified string. One easy method is to iterate through each character of the string, Once a restricted character is seen, we move all the characters appearing after it by one position. This approach involves a lot…
Counting sort as its name indicates sort a list of integers by counting the occurrence each number appearing in the list. This is possible when the range of integers (particularly small) is given. Unlike comparison based sorting algorithms which run in O( n log n) time in the worst case, Counting sort runs O(n) time.…
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…