Freaks City

Sliding Window Technique LeetCode 209: Find the minimal length of a contiguous subarray of which the sum is at least target. class Solution { public: int minSubArrayLen(int target, vector<int>& nums) { int minLen = INT_MAX; int windowSum = 0; int left = 0; int currentLen = 0; for (int right ...

Evaluating Reverse Polish Notation Problem: Given an array of strings tokens representing an arithmetic expression in Reverse Polish Notation, evaluate the expression and return the resulting integer value. Constraints: Valid operators are '+', '-', '*', and '/'. Each operand can be an integer or another expression. Division between two intege ...

Bitwise AND Partition Counting: Analysis and Algorithm Implementation Problem Statement Given (n) integers (a_1, a_2, \dots, a_n), randomly partition them into two non-empty groups. Calculate the number of partitions where the bitwise AND of the numbers in each group results in the same value. Constraints: (1 \le n \le 60), (0 \le a_i < 2^{1 ...

Given an integer array nums and an integer k, a sliding window of size k traverses the array from left to right. Only the k numbers within the window are visible at any step, and the window shifts right by one position after each move. The task is to return the maximum element inside the window for every valid posiiton. Example 1 Input: nums = ...

Problem Statement Given a string, determine the length of the longest contiguous substring that does not contain any repeating characters. Sliding Window Approach The sliding window technique maintains a window defined by left and right pointers. As the right pointer expands the window, we track character frequencies. If a duplicate is found, ...

713. Subarray Product Less Than K Given an integer array nums and an integer k, return the number of continuous subarrays where the product of all elements is strictly less than k. Input: nums = [10,5,2,6], k = 100 Output: 8 Explanation: The 8 subarrays with product less than 100 are: [10], [5], [2], [6], [10,5], [5,2], [2,6], [5,2,6]. Note tha ...

Minimum Size Subarray Sum Given an array of positive integers nums and a positive integer target, find the minimal length of a contiguous subarray whose sum is greater than or equal to target. If no such subarray exists, return 0. Examples: Input: target = 7, nums = [2,3,1,2,4,3]Output: 2Explanation: The subarray [4,3] has the minimal lengt ...

Squares of a Sorted Array (LeetCode 977) The challenge in squaring a sorted array that contaisn negative numbers is that the largest squares can appear at both ends of the array. While a naive solution involves squaring every element and then sorting the array in $O(n \log n)$ time, a more efficient $O(n)$ approach utilizes the two-pointer tech ...

977. Squares of a Sorted Array Problem Link on LeetCode Approach: Two Pointers Technique Since the array may contain negative numbers, we use two pointers to compare the squares of the elements from both ends. The left pointer starts at the beginning of the array, and the right pointer starts at the end. The larger square is placed at the curre ...

Given an aray of size n ≤ 10^6, determine the maximum and minimum values in each sliding window of size k. Input: Two integers n and k representing the array length and window size. A line containing n integers representing the array elements. Output: Two lines containing the minimum and maximum values for each sliding window positino. Exam ...