- Program to move first element to last in list.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print resultant list of elements in single-line with space separation.
Sample Input:
5
10
20
30
40
50
Sample Output:
20 30 40 50 10
- Program to interchange first and last elements in list.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print resultant list of elements in single-line with space separation.
Sample Input:
5
10
20
30
40
50
Sample Output:
50 20 30 40 10
- Program to split the list into two half's and add first part at the end.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print resultant list of elements in single-line with space separation.
Sample Input:
5
10
20
30
40
50
Sample Output:
30 40 50 10 20
- Program to find second largest and second smallest number from the list.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print two integers in single-line with space separation: second largest and second smallest.
Sample Input:
5
30
10
40
20
50
Sample Output:
40 20
- Program to find difference between sum of even numbers and sum of odd numbers.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print an integer represents difference between sum of even numbers and sum of odd numbers.
Sample Input:
5
30
10
40
20
50
Sample Output:
30
- Program to move all zero's to the end of list.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print resultant list of elements in single-line with space separation.
Sample Input:
6
0
10
0
20
0
30
Sample Output:
10 20 30 0 0 0
- Program that calculate the fractions of its elements that are positive, negative and zeros.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Output Format:
Print fractions of positive, negative and zero in three different lines.
Sample Input:
8
-3
-2
-1
0
0
1
2
3
Sample Output:
0.375
0.375
0.25
Explanation:
Number of positive elements / total elements = 3/8 = 0.375
Number of negative elements / total elements = 3/8 = 0.375
Number of zero elements / total elements = 2/8 = 0.25
- Program to insert an element at given position in list.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Next line of input consists of an integer pos, represents index position
Next line of input consists of an integer newele, represents new elements to be insert.
Output Format:
Print resultant list of elements with space separataion in single line.
Sample Input:
5
10
20
30
40
50
2
25
Sample Output:
10 20 25 30 40 50
Explanation:
n = 5
li = [10,20,30,40,50]
pos = 2
newelement = 25
New list after insertion is [10,20,25,30,40,50]
- Program to delete an element from a list at specified position.
Input Format:
First line of input consists an integer N, represents number of elements for list.
Next N-lines follows an each one with integer store in list.
Next line of input consists of an integer pos, represents index position
Output Format:
Print deleted element at given position or print -1 if given position is out of range.
Sample Input1:
5
10
20
30
40
50
2
Sample Output1:
30
Explanation1:
n = 5
li = [10,20,30,40,50]
Position to be delete 2
30 is element at position 2.
Sample Input2:
5
10
20
30
40
50
7
Sample Output2:
-1
Explanation2:
n = 5
li = [10,20,30,40,50]
Position to be delete 7
Position 7 is out of range, so print -1
- Program to reverse of list elements without using list built-in methods.
Sample Input:
5
10
20
30
40
50
Sample Output:
50 40 30 20 10
- Program to remove duplicates in list.
Sample Input:
6
1
2
3
2
4
2
Sample Output:
1 2 3 4
- Program to count the frequency of each element of list.
Sample Input:
6
1
2
3
2
4
2
Sample Output:
1 1
2 3
3 1
4 1
- Program to sort the elements of list in descending order.
Sample Input:
5
3
4
2
5
1
Sample Output:
1 2 3 4 5
Explanation:
Arrange the list elements in descending order.
- Program to find second smallest and second largest numbers from list.
Sample Input:
8
4
6
1
5
2
7
3
8
Sample Output:
2 7
- Program to find duplicate element in k-distance. If found print "YES" otherwise "NO".
Sample Input1:
8
1
2
3
4
1
2
3
4
3
Sample Output1:
NO
Explanation:
Each element in the given array li[] appears twice and the distance between every element and its duplicate is 4.
Sample Input1:
6
1
2
3
2
4
5
3
Sample Output1:
YES
Explanation:
2 is present at index 1 and 3.
