[Solved] You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given the head of a linked list, remove the nth node from the end of the list and return its head.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string “”.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Roman to Integer – Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Integer to Roman – Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, 2 is written as II in Roman numeral, just two one’s added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++’s atoi function).Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[I]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amount of water a container can store.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forward.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 – 1], then return 0. Assume the environment does not allow you to store 64-bit integers (signed or unsigned).Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given a string s, return the longest palindromic substring in s.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] Given a string s, find the length of the longest substring without repeating characters.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022
[Solved] 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 that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.Leetcode SolutionsAbhishek SharmaSeptember 1, 2022