3 Gmail Productivity Tips For A Saner Mailbox

GMAIL PRODUCTIVITY TIPS:

Pretty much every one of us would be using Gmail, and I’m going to share some Gmail productivity tips that would help you achieve a saner mailbox.

Before we proceed, these are commonplace tips and a bunch of my friends are already using it — So you can just skim over this article for correctness and move on. This is for the people who don’t use Gmail’s features as efficiently as you do 🙂

Gmail productivity Tips – Tip # 1: Alias/Extra Gmail IDs:

Since this comes directly in correlation with the other features, I’d like to make this the first item of discussion. As you might be aware, Google ignores any dots in their Gmail.com emails (This however, doesn’t hold valid for the Google Apps email IDs).

Therefore, your a[email protected] can also be written asa[email protected] or a.[email protected] and so on.

It gets better from here. A little known feature of Gmail is that Google ignores any characters after a ‘+’. So a[email protected],a[email protected] etc. would still deliver emails to a[email protected]

Now this is a great gift for people who pretty much live on the WWW, where they can give different set of email IDs to different websites and still get all their emails in one inbox.

Read more

Solving Project Euler 42 Coded Triangle Numbers

Project Euler 42 Coded Triangle Numbers

Following up from my previous post, where I attempted Solving Project Euler 13 Large Sum, I took up Hackerrank’s simplified version of Project Euler 42 Coded Triangle Numbers this time

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 Statement

The nth term of a sequence of triangle numbers is given by,

So the first ten triangle numbers are:

1,3,6,10,15,21,28,36,45,55,⋯

You are given an integer. If it is a triangular number tn, print the term n corresponding to this number, else print −1

Input Format

First line of input contains an integer T denoting the number of testcases. Each of the next T lines contains an integer.

Output Format

Print the answer corresponding to each test case in a new line.

Constraints

1≤T≤10^5
1≤tn≤10^18

Read more

Solving Project Euler 13 Large Sum

Project euler 13 large sum

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 Project Euler 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 the first 10 digits of the final sum

Constraints

1 ≤ N ≤ 10^3

Read more

Simple Program For Finding Symmetrical Point

Finding Symmetrical Point

Following up from the earlier post, I first started with a very simple mathematical problem of finding symmetrical point, given a set of coordinates.

problem statement

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 P and Q.

Output Format

For each test case output x and y coordinates of the symmetric point (each point in a new line).

Read more

Getting Back to Code with Hackerrank Problems

Few days back, I started solving some of the simpler challenges in Hackerrank.

I had to start with the simpler ones because I hadn’t coded for almost a year and even when I was coding actively, I hadn’t actually solved Hackerrank type problems since 2012.

I first started with the learning/practice domain for Ruby as Ruby is my preferred language for coding and one that I would be using at work if I ever get back into coding at my job (Which is unlikely, as I’m currently a part of Business Development team at work, a job that I love a lot)

Once I completed the entire Ruby tutorial track, which took around 2 days, thanks to my attention-deficit laziness, I moved on to solving very simple problems in Mathematical domain and under the Project Euler contest.

Read more