leetcode 1816 solution in java

Truncate Sentence A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each of the words consists of only uppercase and lowercase English letters (no punctuation). For example, “Hello World”, “HELLO”, and “hello world hello world” are all sentences. You are given a sentence s​​​​​​…

How to Download and Install JMeter on windows 10?

Download And Installation Of JMeter is mentioned below:- Step 1:- Go to the below mentioned link. Which is the official site for Apache JMeter. JMeter Download Step 2:- Download the zip file from Binaries Section. Zip file is applicable for Windows Operating System. As here clearly mentioned that Java 8+ is required and it should…

What is performance testing and what is it’s importance?

Performance testing is the segment of software testing where the software applications are tested on a particular work load. This work load are calculated based on the user experience and is usually shared by the Business Team. And the behavior of that application like stability and response time under that predefined workload is measured and…

leetcode 1854 solution in java

Maximum Population Year Solution This above problem is taken from https://leetcode.com/problems/maximum-population-year/ Solution:- Approach:- Code:- public static int methodeName(int[][] arr) { //defined one array years with size 2051 int[] years = new int[2051]; //Now hover over the goven 2d array for (int[] log : arr) { //given array is {1952,1961},{1953,1961 } //so for first iteration log…

leetcode 1859 solution in java

Sorting the Sentence A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of lowercase and uppercase English letters. A sentence can be shuffled by appending the 1-indexed word position to each word then rearranging the words in the sentence. For example,…

LeetCode 1869 Solution in Java

Longer Contiguous Segments of Ones than Zeros Solution:- Approach:- Code:- public boolean checkZeroOnes(String s) { int countOne = 0; int countZero = 0; int maxOne=0; int maxZero = 0; for ( char m:s.toCharArray()) { if (m==’0′) { countZero ++; countOne=0; } if (m==’1′) { countOne ++; countZero=0; } maxOne = Math.max(maxOne,countOne); maxZero = Math.max(maxZero,countZero); }…