Variable Swap Invariants
FIRST_PARTY_ORIGINALWrite a function that swaps two integer variables without using any temporary variable.
Difficulty: EASYAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Binary Tree Path Invariant Validation
FIRST_PARTY_ORIGINALGiven the root of a binary tree, compute the maximum path sum between any two nodes.
Difficulty: HARDAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
String Character Frequency Anagram Verification
FIRST_PARTY_ORIGINALWrite a function that determines whether string t is an anagram of string s using character frequency arrays.
Difficulty: EASYAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Subarray Target Sum Invariant Verification
FIRST_PARTY_ORIGINALGiven a sorted array of positive integers and a target sum, find continuous start and end indices matching target.
Difficulty: MEDIUMAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Stack Parenthesis Balance Verification
FIRST_PARTY_ORIGINALDetermine if a string containing '()', '{}', and '[]' characters is validly balanced.
Difficulty: EASYAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Rotated Sorted Array Search Invariants
FIRST_PARTY_ORIGINALSearch for a target value in a rotated sorted array in O(log N) runtime.
Difficulty: MEDIUMAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Floyd's Fast-Slow Pointer Cycle Verification
FIRST_PARTY_ORIGINALDetermine if a singly linked list contains a cycle using O(1) auxiliary memory.
Difficulty: MEDIUMAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
2D Grid Connected Component Traversal
FIRST_PARTY_ORIGINALCount the number of distinct islands in a 2D binary grid where '1' is land and '0' is water.
Difficulty: HARDAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Minimum Coin Change Dynamic Programming
FIRST_PARTY_ORIGINALGiven coin denominations and a total amount, return the minimum number of coins needed to make up that amount.
Difficulty: MEDIUMAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED
Min-Heap Top K Frequent Elements
FIRST_PARTY_ORIGINALGiven an integer array nums and an integer k, return the k most frequent elements in O(N log k) time.
Difficulty: MEDIUMAuthor: GrowCode Core Curriculum TeamAudit Status: PASSED