Problem Statement Given an integer n, return all simplified fractions between 0 and 1 (exclusive) such that the denominator is less than or equal to n. A simplified fraction is a fraction where the numerator and denominator are coprime (i.e., their greatest common divisor is 1). Example 1:Input: n = 2Output: [“1/2”] Example 2:Input: n…

Problem Statement Given the head of a singly linked list, group all odd-indexed nodes together followed by even-indexed nodes. Example 1: Example 2: Constraints: Approach to Solve the Problem (Simple Language) Idea: Steps: Why it works: Java Code Solution Dry Run Example Input: Step-by-step Execution: Final List: Textual Diagram for Understanding Complexity Analysis This two-pointer…

Problem Statement You are given a circular integer array nums of length n. Return the maximum possible sum of a non-empty subarray of nums. Example 1: Example 2: Approach to Solve the Problem (Simple Language) Idea: Steps: Why it works: Java Code Solution Dry Run Example Input: Step-by-step Execution: Result: 10 Textual Diagram for Understanding…

Problem Statement A Trie (Prefix Tree) is a tree data structure used to efficiently store and search strings. Implement a Trie with the following operations: Example: Approach to Solve the Problem (Simple Language) Idea: Operations: Why Trie works efficiently: Java Code Solution Dry Run Example Input: Step-by-step Execution: Textual Diagram for Understanding Complexity Analysis

Problem Statement You are given a string num representing a non-negative integer and an integer k. Example 1: Example 2: Approach to Solve the Problem (Stack-based Greedy) Idea: Steps: Why this works (Greedy): Java Code Solution Dry Run Example Input: Step-by-step Execution: Textual Diagram for Understanding Complexity Analysis

Problem Statement You are given a sorted array nums where every element appears exactly twice, except for one element that appears only once. Return the single element that appears only once. Constraints: Example 1: Example 2: Approach to Solve the Problem (Binary Search) Idea: Steps: Why it works: Java Code Solution (Binary Search) Dry Run…

Problem Statement You are given a 2D integer array image representing an image, and three integers sr, sc, and newColor. Return the modified image. Example: Constraints: Approach to Solve the Problem (Simple Language) Idea: DFS Steps (Recursive): Java Code Solution (DFS) Dry Run Example Input: Step-by-step Execution: Final Image: Textual Diagram for Understanding Complexity Analysis

Problem Statement In a town of n people labeled 1 to n: You are given an array trust where trust[i] = [a, b] means person a trusts person b. Return the label of the town judge, or -1 if no judge exists. Example: Approach (Single-Array Optimized) Idea: Steps: Why it works: Java Code Solution Dry…

Problem Statement Given a positive integer num, determine if it is a perfect square. Return true if num is a perfect square, otherwise return false. You cannot use built-in square root functions. Example 1: Example 2: Constraints: Approach to Solve the Problem (Simple Language) Idea: Steps: Why binary search works: Important Note: Java Code Solution…

Problem Statement You are given an array coordinates where each element is a pair [x, y] representing a point on a 2D plane. Return true if these points all lie on a straight line in the XY-plane, otherwise return false. Example 1: Example 2: Constraints: Approach to Solve the Problem (Simple Language) Idea: Steps in…