[Question]: Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s. A shift on s consists of moving the leftmost character of s to the rightmost position. For example, if s = “abcde”, then it will be “bcdea” after one shift. Input: s = “abcde”, goal = “abced” Output: false
Check if string is rotated Read More »
[Question]: In integer string Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string “” if no odd integer exists. A substring is a contiguous sequence of characters within a string. Example 1: Input: num = “52” Output: “5” Explanation: The only non-empty substrings are “5”, “2”, and “52”. “5” is the only odd number input
Find largest odd Number/Sequence in String Read More »
[Question] Given a string s, reverse the words of the string.Note: Remove extra spaces from output Examples: Example 1: Input: s=”My Name is Janesh” Output: “Janesh is Name My” Example 2: Input: s= ” My Name is Janesh” Output: “Janesh is Name My”
Reverse words in String Read More »
[Question]: A valid parentheses string is either empty “”, “(” + A + “)”, or A + B, where A and B are valid parentheses strings, and + represents string concatenation. For example, “”, “()”, “(())()”, and “(()(()))” are all valid parentheses strings. Return s after removing the outermost parentheses of every primitive string in the primitive decomposition of s. Example 1: Input: s = “(()())(())” Output: “()()()” Explanation: The input string
Remove Outermost Parentheses || String Read More »
[Question]: Given a row-wise sorted matrix of size r*c, where r is no. of rows and c is no. of columns, find the median in the given matrix. where – r*c is odd Example 1: Input: r = 3 , c = 3 1 4 9 2 5 6 3 8 7 Output: Median = 5
Median of Row Wise Sorted Matrix Read More »
[Question]: A peak element in a 2D matrix is an element that is strictly greater than all of its adjacent neighbour’s to the left, right, top, and bottom. Given a 0-indexed m x n matrix mat where no two adjacent cells are equal, find any peak element mat[i][j] and return the length 2 array [i,j].You may assume that the entire matrix is surrounded by an outer perimeter with the value -1 in each cell. Write an
Find a Peak Element (Find Peak Grid in Matrix) Read More »
[Question] : Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Example 1: Input: matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 5 Output: true Why Binary Search is not useful for searching in unsorted arrays? The basic condition to apply Binary Search anywhere in any algorithm is
Search a 2D Matrix II (Sorted Matrix) Read More »
[Question]: Given a boolean 2D array, where each row is sorted. Find the row with the maximum number of 1s.
Find the row with maximum number of 1s Read More »
[Question] We have an horizontal number line. On that number line, we have gas stations at positions stations[0], stations[1], …, stations[N-1], where N = size of the stations array. Now, we add K more gas stations so that D, the maximum distance between adjacent gas stations, is minimized. We have to find the smallest possible value of D. Find the answer exactly to 2 decimal
Minimize Max Distance to Gas Station Read More »
[Question]: Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. A subarray is a contiguous part of the array. Example 1: Input: nums = [7,2,5,10,8], k = 2 Output: 18 Explanation: There are four ways to split nums into two subarrays. The
Split Array Largest Sum Read More »
