2275. Largest Combination With Bitwise AND Greater Than ZeroGiven a list of integers, return the size of the largest combination of integers with a bitwise AND greater than 0.Jan 91Jan 91
Minimum Appends for Palindrome!Given a string s we need to tell minimum characters to be appended (insertion at end) to make a string palindrome.Oct 16, 202181Oct 16, 202181
Minimum Deletions to Make Character Frequencies UniqueA string s is called good if there are no two different characters in s that have the same frequency.Oct 16, 20213Oct 16, 20213
Jump Game IVGiven an array of integers arr, you are initially positioned at the first index of the array.Oct 15, 2021Oct 15, 2021
Jump Game VIIYou are given a 0-indexed binary string s and two integers minJump and maxJump. In the beginning, you are standing at index 0, which is…Oct 15, 20214Oct 15, 20214
Jump Game IIIGiven an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can…Oct 15, 2021Oct 15, 2021
Jump Game IIGiven an array of non-negative integers nums, you are initially positioned at the first index of the array.Oct 15, 20211Oct 15, 20211
Knuth Morris Pratt Algorithm for pattern matching in linear timeOne of the most elegant and impressive string algorithm which I have seen is KMP algorithm. Its beautiful. The idea of matching a pattern…Oct 9, 202117Oct 9, 202117
72. Edit DistanceGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.Oct 2, 20211Oct 2, 20211
Longest Common SubsequenceGiven two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.Oct 2, 2021Oct 2, 2021
Largest Continuous Sequence Zero SumFind the largest continuous sequence in a array which sums to zero.Oct 1, 2021Oct 1, 2021
#11 Container with most waterGiven n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that…Sep 17, 2021Sep 17, 2021
