Following up from my previous post, where I attempted Solving Project Euler Problem 13 - Large Sum, I took up Problem 42 - Coded Triangle Numbers While the original problem is a bit more complex, Hackerrank had broken it down a bit more simpler. Note: This solution times out after the first 2 test cases out of a total 7 test cases. So, while the solution is technically correct, it's not the most optimal way to go about it. Problem

For my next problem, I decided to take one of the popular routes and experimented with few of the simpler problems from Project Euler The first problem that I tried was Problem 13 - Large Sum Problem Statement Work out the first ten digits of the sum of N 50-digit numbers. Input Format First line contains N, next N lines contain a 50 digit number each. Output Format Print only first 10 digit of the final sum Constraints 1 ≤ N

Following up from the earlier post, I first started with a very simple mathematical problem of finding symmetrical point, given a set of coordinates. The problem statement is as follows: Given two points P and Q, output the symmetric point of point P about Q. Input Format The first line contains an integer T representing the number of testcases Each test case is a line containing four space separated integers Px Py Qx Qy representing the (x,y) coordinates of