You are given an integer array nums. You can choose exactly one index (0-indexed) and remove the element. Notice that the index of the elements may change after the removal. For example, if nums = [6,1,7,4,1]: An array is fair if the sum of the odd-indexed values equals the sum of the even-indexed values. Return…
Month: February 2023
Leet code problem 1641: – Count Sorted Vowel Strings
Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted. A string s is lexicographically sorted if for all valid i, s[i] is the same as or comes before s[i+1] in the alphabet. Example 1: Input: n = 1Output:…
Leet code problem 1638: – Count Substrings That Differ by One Character
Given two strings s and t, find the number of ways you can choose a non-empty substring of s and replace a single character by a different character such that the resulting substring is a substring of t. In other words, find the number of substrings in s that differ from some substring in t…
Leet code 1637: – Widest Vertical Area Between Two Points Containing No Points
Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area. A vertical area is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area is the one with the maximum width….
Leet code problem 1631: – Path with Minimum Effort
You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1) (i.e., 0-indexed). You can move…
Leet code problem 1672: – Richest Customer Wealth
You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the ith customer has in the jth bank. Return the wealth that the richest customer has. A customer’s wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that…
Leet code problem 1668: – Maximum Repeating Substring
For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word’s maximum k-repeating value is the highest value k where word is k-repeating in sequence. If word is not a substring of sequence, word’s maximum k-repeating value is 0. Given strings sequence and word, return…
How to compare “Strings” in Jenkins pipeline scripts?
To compare the “String” we can follow the below approach.
How to display HTML page inside mail body with email-ext plugin in Jenkins?
For this we need to install the Junit plugin for Jenkins. As if we check the source template of the email-ext plugin as mentioned here, then we can find that for Junit report part, it’s fetching the values from Junit result. Then we need to call this in the pipeline as mentioned below, assuming we…
Leet code problem 1662: – Check If Two String Arrays are Equivalent
Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise. A string is represented by an array if the array elements concatenated in order forms the string. Example 1: Input: word1 = [“ab”, “c”], word2 = [“a”, “bc”]Output: trueExplanation:word1 represents string “ab” + “c” ->…