java

LeetCode, Binary Search, Data Structure

[Solved] Peak Index in a Mountain Array LeetCode Problem in Java

Peak Index in a Mountain Array: Let’s call an array arr a mountain if the following properties hold: arr.length >= 3 There exists some i with 0 < i < arr.length – 1 such that: arr[0] < arr[1] < … arr[i-1] < arr[i] arr[i] > arr[i+1] > … >…

Saurav Hathi
June 14, 2022

LeetCode

[Solved] Naming a Company LeetCode Contest Problem

Naming a Company: You are given an array of strings ideas that represents a list of names to be used in the process of naming a company. The process of naming a company is as follows: Choose 2 distinct names from ideas, call them ideaA and ideaB. Swap…

Saurav Hathi
June 12, 2022

LeetCode

[Solved] Fair Distribution of Cookies LeetCode Contest Problem

Fair Distribution of Cookies: You are given an integer array cookies, where cookies[i] denotes the number of cookies in the ith bag. You are also given an integer k that denotes the number of children to distribute all the bags of cookies to. All the cookies in the same…

Saurav Hathi
June 12, 2022

LeetCode

[Solved] Minimum Path Cost in a Grid LeetCode Contest Problem

Minimum Path Cost in a Grid: You are given a 0-indexed m x n integer matrix grid consisting of distinct integers from 0 to m * n – 1. You can move in this matrix from a cell to any other cell in the next row. That is, if you are in…

Saurav Hathi
June 12, 2022

LeetCode

[Solved] Calculate Amount Paid in Taxes LeetCode Contest Problem

Calculate Amount Paid in Taxes: You are given a 0-indexed 2D integer array brackets where brackets[i] = [upperi, percenti] means that the ith tax bracket has an upper bound of upperi and is taxed at a rate of percenti. The brackets are sorted by upper bound (i.e. upperi-1 < upperi for 0 < i < brackets.length). Tax…

Saurav Hathi
June 12, 2022

LeetCode, C++, Java, Python

[Solved] Match Substring After Replacement LeetCode Contest Problem

Match Substring After Replacement: You are given two strings s and sub. You are also given a 2D character array mappings where mappings[i] = [oldi, newi] indicates that you may replace any number of oldi characters of sub with newi. Each character in sub cannot be replaced more than once. Return true if it is possible to make sub a substring…

Saurav Hathi
June 11, 2022

Java

Write a class ElementCheck with a public method checkFirstOrLast that takes two parameters one is arr of type int[] and second one is arg of type int and returns true

Write a class ElementCheck with a public method checkFirstOrLast that takes two parameters one is arr of type int[] and second one is arg of type int and returns true if the arg is first or last element in the arr else returns false. The return type of checkFirstOrLast is boolean. Write a class ElementCheck with a public method checkFirstOrLast Assumption: arr is never null Here is…

Saurav Hathi
June 8, 2022