Author name: Admin

Row with max 1s

gfg-potd

Given a boolean 2D array, consisting of only 1’s and 0’s, where each row is sorted. Find the 0-based index of

Remove Duplicates

gfg-potd

Given a string str without spaces, the task is to remove all duplicate characters from it, keeping only the first occurrence. Note: The

2976. Minimum Cost to Convert String I

leetcode-potd

You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character arrays original and changed, and an integer array cost,

Form a palindrome

gfg-potd

Given a string, find the minimum number of characters to be inserted to convert it to a palindrome. Examples :

K-Pangrams

gfg-potd

Given a string str and an integer k, return true if the string can be changed into a pangram after at most k operations, else

Array to BST

gfg-potd

Given a sorted array. Convert it into a Height Balanced Binary Search Tree (BST). Return the root of the BST. Height-balanced BST means a binary tree in

Scroll to Top