A computer science portal
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); }…
Problem:- Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. Solution:- Summary of the problem:- Here we have to search in the given sorted array that if the given number…
Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists. Ans:- To solve this approach, we will create a Dummy Head. And as the two given list will be sorted, so we have to only compare the individual…