Freaks City

Given two integer arrays nums1 and nums2 sorted in non-decraesing order, merge nums2 into nums1 to produce a single sorted array. The array nums1 has length m + n, where the first m elements contain values to be merged and the last n elements are placeholder zeros. nums2 has length n. The modification must occur in-place within nums1. Approach ...

Given two integer arrays, impleemnt a function that returns their intersection — the set of elements that appear in both arrays, with each result appearing only once regardless of frequency. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2]<br></br>Output: [2] Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]<br></br ...

Binary Search Implementation Element Removal Optimization Sorted Squares Generation Spiral Matrix Construction Binary Search Implementation Binary seearch implementation requires careful consideration of boundary conditions: Loop condition: left < right vs left <= right Right boundary update: right = middle vs right = middle ...

Longest Valid Parentheses Given a string containing only '(' and ')', find the length of the longest valid (well-formed and contiguous) parentheses substring. Dynamic Programming Solution Define dp[i] as the length of the longest valid parentheses ending at position i. To each character at index i: If s[i] is '(', set dp[i] = 0 If s[i] is ')', ...

Finding the Kth Node from the End of a Linked List To locate the kth node from the end efficient, use two pointers—fast and slow. Advance the fast pointer by k steps first. Then move both pointers forward until fast reaches the end. At this point, slow will be pointing to the desired node. int kthToLast(struct ListNode* head, int k) { struc ...

Hash Map Techniques LeetCode 1: Two Sum Utilize a hash map to store elements not yet encountered, while searching for the complement target - nums[i]. public int[] twoSum(int[] nums, int target) { int[] result = new int[2]; Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { in ...

Given the head nodes headA and headB of two singly linked lists, determine the node at which the two lists intersect. Return the intersecting node. If no intersection exists, return null. The linked list structure is guraanteed to be acyclic. The original structure of both lists must remain unchanged after the function returns. Example 1: Input ...