


The first line of input contains the first 32 bit signed integer 'A'.
The second line of input contains the second 32 bit signed integer 'B'.
The only line of output contains 'true' if the multiplication of 'A' and 'B' is overflowing in 32 bit signed integer or 'false' otherwise.
Return the expected boolean value from the function, no need to print anything.
-2^31 <= A <= 2^31 - 1
-2^31 <= B <= 2^31 - 1
where 'A' and 'B' are the given integers.
Time Limit: 0.5 sec.
Try to solve this problem assuming you can only have 32 bit signed integers (Without using any typecasting to other datatypes)
Let’s say the two integers being multiplied together are ‘a’ and ‘b’.
There will be three possibilities:
Pair Product Div by K
Pair Product Div by K
Merge Two Sorted Arrays Without Extra Space
Merge Two Sorted Arrays Without Extra Space
Co-Prime
First Digit One
Special Digit Numbers