Solve LeetCode problem [P7]

[salastro]

I would like to request to see the following problem solved:

• Name: Reverse Integer
• ID: 7
• Link: https://leetcode.com/problems/reverse-integer/

My proposed solution(s):

I was not able to think of a straightforward solution that works on negative integers. Probably my solution for problem no. 2 (#11) affected my thinking in a negative way.

⍝ arrToInt needs to start at index zero since the use of 10*0 in units
⎕IO←0

⍝ the range in which acceptable values exist
range ← (¯2*31) (1-⍨2*31)

⍝ if in range return the number, zero otherwise
inRange ← {⍵×≠/range<⍵}

⍝ convert an array of single-digit integers into an integer in reverse (does
⍝ not work if negative)
arrToInt ← {+/⍵×10*⍳≢⍵}

⍝ convert the integer into an array (does not work if negative) reverse it into
⍝ an integer then check if in range
Sol ← { inRange arrToInt ⍎¨⍕ ⍵ }

EDIT:-
I do not know how, but I didn't think of operating on the absolute value and then multiplying the result by the sign.

Sol ← { (×⍵) × inRange arrToInt ⍎¨⍕ |⍵ }