A computer science portal
Under the Programming Geek section we discusses mainly the topics related to IT. This topics will be helpful for all the budding and experience software engineers.
Minimum Operations to Make the Array Increasing You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1. For example, if nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,3,3]. Return the minimum number of operations needed…
Sign of the Product of an Array There is a function signFunc(x) that returns: 1 if x is positive. -1 if x is negative. 0 if x is equal to 0. You are given an integer array nums. Let product be the product of all values in the array nums. Return signFunc(product). The problem description…
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…
Getters and Setters are mainly used to hide the details about the fields of a class. Suppose we have a class, named Car. As we know, class in a blueprint of an object. So, the Car class is the blueprint of real object Car. Now Car object has engines and wheels. We are using only…
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…
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,…
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…
Problem Statement:- Given an array nums and a value val, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. The order of elements can be changed. It doesn’t matter what you leave beyond…
Given an expression string exp, write a program to examine whether the pairs and the orders of “{“, “}”, “(“, “)”, “[“, “]” are correct in exp. Example: Logic: Given String:- Step 1:- Take this String as an input of the function. This Function will return the Boolean. Step 2: Check all the opening brackets…