|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
Given coordinates of 2 points on a cartesian plane, output the distance between them rounded up to nearest integer.
The first line of the input contains the number of test cases T. Each line contains 4 integers denoting those 2 points as (x1,y1), (x2,y2).
For each test case print in a single line the distance between the two points.
0 0 2 -2
-20 23 -15 68
30 37 79 -51
-69 63 57 11