BUBBLE SORT PROGRAM Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. Here is a simple implementation of Bubble Sort in Java: In this code, bubbleSort(int arr[]) is the… Read More »
Example 1:Input: x = 120 Output: 21 Explanation of the overflow check: If the input x is 0, the loop will not run, and 0 will be returned, which is the correct result. In the provided code, digit > 7 and digit < -8 are used as conditions to check for overflow. Let’s break down why these conditions… Read More »
Input: nums = [1,7,3,6,5,6] Output: 3 Explanation: The pivot index is 3. Left sum = nums[0] + nums[1] + nums[2] = 1 + 7 + 3 = 11 Right sum = nums[4] + nums[5] = 5 + 6 = 11 To find the pivot index in an array, we need to find an index such that the sum… Read More »
Example 1:Input: gain = [-5,1,5,0,-7] Output: 1 Explanation: The altitudes are [0,-5,-4,1,1,-6]. The highest is 1. To find the highest altitude of a point during a road trip, we can iterate through the gain array and calculate the cumulative altitude at each point. Then, we track the maximum altitude reached during the trip. Here’s the Java program implementing… Read More »
Example 1: Input: strs = [“flower”,”flow”,”flight”] Output: “fl” To find the longest common prefix among an array of strings, we can use the following approach: Here’s the Java program implementing the above approach: Explanation:
Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Explanation:
Example 1:Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. }
Example: Input: word = “cbaaaabc”, forbidden = [“aaa”,”cb”] Output: 4 Certainly! Let’s break down the problem and then provide a Java solution: Problem Explanation: You are given a string word and an array of strings forbidden. You need to find the length of the longest valid substring of word, where a substring is considered valid if none of… Read More »
In the Given Array n*n Matrix, return the Transpose Matrix EX: matrix=[[1,2,3],[4,5,6],[7,8,9]]Output: [[1,4,7], [2,5,8], [3,6,9]] To transpose a matrix in Java, you can create a new matrix where the rows become columns and vice versa. Here’s a simple implementation:
Given an image represented by an N*N . Write a method to rotate the image by 90 degrees. Let’s go through the program step by step: This approach achieves the 90-degree clockwise rotation in place, meaning it modifies the original matrix without using additional space proportional to the input matrix size. The time complexity of this approach is… Read More »