About Us

Hello, 

I am 4th year IT Undergraduate at Indian institute of Information Technology, Allahabad.

I want to help you out with programming concepts and introduce you to competitive programming world. 

If you love my posts share them and like them :P.

Comments

Post a Comment

Popular posts from this blog

SPOJ- PIE solution

Image
Hello! This post is about solution of SPOJ problem PIE :  visit question  PIE So, we will be looking at the implementation part of it using Binary Search. We encourage you to try solving problem first by yourself but still if you are getting trouble then move on to tutorials. Here we require to maximize the cake volume each person would get: Constraints: 1.  Each person would get equal volume of cake. 2.  We will not mix two cake pieces to make one piece.
Read more

Developing a Google Data Studio Connector: Part 2

Image
In part 1 of this tutorial we learnt about what Data Studio is and How to use it. In this tutorial we will kickstart development of our own data studio connector. So let's begin. What are the requirements? A Google account Knowledge of JavaScript A little information on how to use data studio to create visualizations. What is the goal? Data Studio Community Connectors enable direct connections from Data Studio to any internet accessible data source. Here we will be building a simple connector that connects to public GitHub APIs and compares two users data. We will then create visualizations to analyze the GitHub profiles. Step 1: Create a project on AppScript We will use AppScript to write code for our community connector. AppScript makes it easy to deploy our connector and debug it. Visit AppScript and click on New Script to create a new script file. It will open a new project. Rename the project and remove all the contents of code.gs file. We will start wr...
Read more

Sum of Pairwise XOR (explained BITS manipulation)

Image
Hey there!! Waiting for learning new things? So here it is. It is a question given here :- click here . We encourage you to try solving problem first by yourself but still if you are getting trouble then move on to tutorials. So, in this question we require to find sum of XOR of all pairs that can be made in a set. As you can see time limit for this question is 2 sec. So, going by conventional method will require O(n^2) complexity solution. As n can be 10^6, Hence it is difficult to pass under given constraints . So what should be the logic?
Read more