Ishita Juneja Blogs

Were you trying to solve the maximum sum of contiguous subarray problems? Did you find It difficult and confusing? You are on time to read this article! Here we will discuss everything from the concept of a subarray to the ways of finding its maximum contiguous sum. With the help of this article, you will be easily able to solve questions where you need to find the subarrays for a given array or the   largest subarray with 0 sum s . In this article, we will discuss the following: What is a subarray? What are the methods of finding the maximum sum of a subarray? What is Kadane’s Algorithm? What is the Brute Force approach? Tips to keep in mind while solving the question. What is the  first unique character in a string?   What is a Subarray? Any subset of the original array’s indices can be used to define a subarray, and a contiguous subarray. A contiguous subarray is defined by an interval of indices, which includes the first and last elements as well as everything in betw...

Devised by John Von Neumann, the merge sort algorithm in programming languages is used to derive outputs by the principle of merging. Professional programmers for Java and other languages might be acquainted with the fact that the merge sort algorithm is used for counting the number of inversions in a given list. This algorithm is employed for external sorting. The prime rule to  merge two sorted arrays  using  the merge sort algorithm is to divide the input statement into two equal halves so that we can maintain uniformity after deriving the output. Once the process has been initiated we can confirm the clarity of the output after considering the first and last occurrences in the sorted arrays. This blog will iterate further on the concept so read till the end.   What do you mean by merging two sorted arrays? Before understanding the concept of how you can merge two sorted arrays, let us understand what sort of output is generated after merging two sorted arrays. Th...

Sets are a group of elements available for computation. The array is one of the most commonly used types of sets. Array is amongst top used concepts in computer science. And you might have heard this term a lot!  But do you know that these sets or arrays can be further divided into several parts? The sets can be divided into different parts based on the element placement and order. These parts are –  Subsequence Substring/subset Subarray Arrays and the further parts of arrays are quite popular amongst interviewers. Various questions based on subsets, subsequences, and subarrays are asked during coding and technical assessment at the tech giants.  These questions include  minimum subset sum difference , print subarray of a given array, reverse the subsets of the array, or  longest palindrome subsequence .  To resolve such questions, you will need to pay a lot of attention to arrays and their parts.  In this article, we will particularly talk about one o...

I f you are a programmer, you must have heard about the concept of linked lists, quite a few times!    Learning about linked lists is essential as they form an important part of the data structure. Hence, we have come up with this blog wherein we are going to explain in depth about linked lists, its categories, how it is represented and what are the functions that it performs.   Also, we are going to discuss how to  sort a stack  and   remove loop in linked list . But first, you have to know about what actually linked lists are?   What is a Linked List?    Linked lists are defined as the series of data structures which are connected to each other through links. In this sequence, there are certain items. Whereas, each link has some sort of connection with the other link.    After array, linked list is the most useful and popular data structure. When you are studying about linked list, it’s important for you to understand its three ma...