Sharooq

Solution: Leetcode 21 Solving the Merge Two Sorted Lists Problem in Python

You are given the heads of two sorted linked lists, list1 and list2. Merge the two lists into 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 -

Linked List

Solution: Leetcode 206 Reversing a Singly Linked List

Given the head of a singly linked list, our task is to reverse the list and return the reversed version. For example, if the input linked list is [1, 2, 3, 4, 5], the reversed list should be [5, 4, 3, 2, 1].

Leetcode -

Stack

Solution: Leetcode 155 Designing a MinStack with Constant Time Complexity in python

Design and implementation of a special kind of stack called a MinStack. The MinStack supports the usual stack operations such as push, pop, and top, but it also provides a method to retrieve the minimum element in constant time, O(1).

Leetcode -

Array

Solution: Leetcode 20 Valid Parentheses Problem and its Solution in Python

Given a string s containing only the characters '(', ')', '{', '}', '[', and ']', we need to determine if the input string is valid. An input string is considered valid if the following conditions are met:

Leetcode -

Stack

Solution: Leetcode 682 Solving a Baseball Scoring Puzzle with Python

You are keeping the scores for a baseball game with a unique set of rules. At the beginning of the game, you start with an empty record. You're given a list of strings operations, where each element represents an operation to apply to the record.

Leetcode -

Array

Solution: Leetcode 1929 Solving the Array Concatenation Problem in Python

You are given an integer array nums of length n. The task is to create a new array ans of length 2n such that ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed). In simpler terms, the array ans is formed by concatenating two copies of the array nums.

Leetcode -

Sliding Window

Solution: Leetcode 27 Removing Elements from an Integer Array in Python

Given an integer array nums and an integer val, the task is to remove all occurrences of val in nums in-place. Additionally, we need to return the number of elements in nums that are not equal to val.

Leetcode -

Sliding Window

Solution: Leetcode 26 Removing Duplicates from Sorted Array in Python

The problem at hand is to remove duplicates from a sorted integer array nums in-place, such that each unique element appears only once. Additionally, we need to return the number of unique elements present in the modified array.

Leetcode -

Array

Solution: LeetCode 88 Merge Sorted Array

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order.

Subscribe to Sharooq