UVA 10298 Power Strings

Problem Link
Problem Type : Adhoc, String Processing
Difficulty Level : Easy
Author : Imdad
Run Time: 0.289

UVA 460 Overlapping Rectangles

Problem Link
Problem Type : Geometry, Overlapping Rectangles.
Difficulty Level : Easy
Author : Imdad
Run Time : 0.015

UVA 10589 Area

Problem Link
Problem Type : Geometry, Circle.
Difficulty Level : Easy
Author : Imdad

UVA 12160 Unlock the Lock

Problem Link
Problem Type : BFS.
Difficulty Level : 5(uHUNT)
Author : Imdad.

UVA 1225 Digit Counting

Problem Link
Problem Type : Brute Force.
Difficulty Level : Easy
Author : Imdad

UVA 11198 Dancing Digits

Problem Link
Problem Type : BFS.
Difficulty Level : 5
Run Time : 0.219
Author : Imdad

Briefly problem statement
Its a BFS problem. A special datastructure is used to save the visited states.

UVA 12356 Army Buddies

Problem Link
Problem Type : Data Structure.
Difficulty Level : Moderate 
Author : Imdad

Briefly problem statement
initialization sequence 1 to n, each operation will delete the specified interval, and returns the position of the point is not deleted interval at both ends of the closest, If you do not return an asterisk.

UVA 532 Solution

Problem Link
Problem Type : Single Source Shortest Path on Unweighted Graph (BFS).
Difficulty Level : Easy
Author : Imdad

Briefly problem statement
A 3d maze is given. We have to find out shortest path between a start point and a end point. Simple BFS can do the trick.

UVA 10183 - How Many Fibs? Solution

Problem Link
Problem Type : Linear Search.
Difficulty Level : Easy
Author : Imdad

Briefly problem statement
Two big number <= 10^100 will be given. We have to find out how many Fibonacci numbers are in the range [a,b]. We can easily generate Fibonacci numbers up to 10^100 digits. There are not more 500 Fibonacci numbers containing less than 10^100 digits.

UVA 11136 Hoax or what Solution

Problem Link
Problem Type : Data-structure(STL set)
Difficulty Level : Easy
Author : Imdad

Briefly problem statement
In his problem we have to insert int in sorted list and find out max and min regularly. So balanced binary tree can be a data structure to approach this problem. For this we can use STL set template.