You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Reverse Array In-Place: O(1) Memory InversionEasy
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
EasyTwo Pointers•Acceptance: 84.5%
Reverse Array In-Place: O(1) Memory Inversion
Targeted in FAANG & Tech OA:GoogleAmazonMicrosoftSwiggy
Real-World Engineering Context
Undo stack history inversion, GPU vertex winding order reversal, and audio sample time-reversal DSP processing.
Given an array `arr`, reverse the elements in-place and return the mutated array without allocating another array of length n.
Sample Test Cases
Input: [[1,2,3,4,5]]
Expected: [5,4,3,2,1]
Input: [[10,20]]
Expected: [20,10]
Input: [[42]]
Expected: [42]
Constraints
- 0 <= arr.length <= 10^5
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.