LeetCode

Question Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume tha

Sumbmission LinkGiven an integer x, return true if x is a palindrome, and false otherwise.Example 1:Input: x = 121Output: trueExplanation: 121 reads a

Sumbmission LinkYou are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string

Submission LinkYou are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of

Submission LinkFor two strings s and t, we say "t divides s" if and only if s = t + t + t + ... + t + t (i.e., t is concatenated with itself one or mo

Submission LinkThere are n kids with candies. You are given an integer array candies, where each candiesi represents the number of candies the ith kid

Submission LinkGiven an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be change

🔗 submission urlLeetCode linkYou have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted i

🔗 submission urlLeetCode linkYou are given two arrays of integers,fruitsandbaskets, each of lengthn, wherefruitsirepresents thequantityof theithtype

🔗 submission urlLeetCode linkYou are given a 2D integer arraysquares. Eachsquaresi = xi, yi, lirepresents the coordinates of the bottom-left point an

🔗 submission urlLeetCode linkGiven an integer arraynums, returnan arrayanswersuch thatansweriis equal to the product of all the elements ofnumsexcept

🔗 submission url 🧩 Problem: Separate Squares II > LeetCode link Description You are given a 2D integer arraysquares. Eachsquares[i] = [xi, yi, li]

🔗 submission urlLeetCode linkGiven an array of characterschars, compress it using the following algorithm:Begin with an empty strings. For each group