Largest Sum Contiguous Subarray
We have a sequence of integers and we need the maximum sum from the continuous sub-sequences. Example- Let the sequence of integers be (3,-4,5,-7,8,-6,21,-14,-9...
Category: Technology
Subarray with given sum
Given a list of integers,our task is to find if a sub-sequence which adds to a given number exists or not. Example- The given list is (1,4,20,5,5) and the given...
Android development primer: Looking into Eclipse IDE
This post is aimed at giving you a little idea about what Eclipse IDE is and how you can use it’s features to the fullest for relatively faster coding. Th...
Android development primer: Multiple Screen Support for Android, using Intents
We saw that on creating an Android Application Project, a skeleton “Hello World” application is created. The “Hello World” module is alw...
Binary Search
This is a short note on using binary search, in continuance of my series on Algorithms. Suppose we have to find whether a particular element exists in the sorte...
Linux intro and Basic commands
Linux is a Unix-like computer operating system. Linux was originally developed as a free operating system for Intel x86-based personal computers. Now its popula...
Android development primer: Layout elements in Android
I’m sure when you look at the Graphical Layout of any xml file in Android, what catches your attention more than the layout itself is the long list of ele...
Android development primer: Creating your first Android Application
So now that you have a little idea what Android is all about, we will create our very first Android Project. Launch Eclipse IDE. Navigate to File->New->An...
Best Code to find n to the power k(n^k)
To find n^k,using brute force, ALGORITHM- Initialize result to 1. Iterate from 1 to k and multiply n to result. Return result. CODE- result=1; for(i=1;i<=k;i...
Tips & Tweaks when programming Math !
In this post,I am going to tell you some tips and tricks which you should know & you can implement in your codes if required.You dont need to require long c...