GHGeetha Haveelaincompscigrad.hashnode.dev·Nov 17, 2025 · 4 min readDay-3 Leetcode Interview Questions169. Majority Element — LeetCode (Easy) Problem Summary You are given an integer array nums of size n. Your task is to return the majority element, which is defined as: The element that appears more than ⌊ n / 2 ⌋ times It is guaranteed that a majo...00
GHGeetha Haveelaincompscigrad.hashnode.dev·Nov 16, 2025 · 3 min readDay-2 Leetcode Interview Questions26. Remove Duplicates from Sorted Array — LeetCode (Easy) Problem Summary You are given an integer array nums that is sorted in non-decreasing order.Your task is to remove duplicates in-place so that each unique value appears exactly once. Key requir...00
GHGeetha Haveelaincompscigrad.hashnode.dev·Nov 13, 2025 · 3 min readDay-1 Leetcode Interview Questions88. Merge Sorted Array — LeetCode (Easy) Problem Summary You are given two sorted arrays: nums1 of size m + n, where the first m elements are valid, and the last n elements are zeros (placeholders). nums2 of size n, containing sorted values. Your...00
GHGeetha Haveelaincompscigrad.hashnode.dev·Mar 27, 2025 · 1 min readDay-10 Leetcode Coding Journey: Mastering Problem-Solving TechniquesLeetcode #88 Problem Statement 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 nums2 into nums1 as one sorted array...00
GHGeetha Haveelaincompscigrad.hashnode.dev·Feb 22, 2025 · 2 min readDay-9 Leetcode Coding Journey: Mastering Problem-Solving TechniquesLeetCode #63: Unique Paths II Problem Statement You are given an m x n grid where some cells contain obstacles (1) and others are free (0).The robot starts at the top-left corner and can only move right or down.The robot must reach the bottom-right c...00