CONVERT

PROBLEM INTO ADD TO MAKE TEST

CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take three variables to store your birth date, birth month, and birth year, respectively, and then print them one by
one in a specified order.

Test Case1:
Explanation:
If the birth date is 22, the birth is May and the birth year is 2001 then
Output:
22
May Variables and
FCP001 2001 Input/Output No
Write a program to take input from the user, and then print it to the output.

Test Case1:
Input:
12
Output: Variables and
FCP002 12 Input/Output No
Write a program to take two values from the user and swap them.

Hint: You can use a third variable.

Test Case1:
Input:
12
4
Output:
4
12

Test Case2:
Input:
99
45
Output:
45 Variables and
FCP003 99 Input/Output No
Write a program to take two numbers from the user and perform Six basic operations (addition, subtraction, multiplication, division,
integer division and modulus) on those two numbers.

Note: Print the output in the order as mentioned in the question.

Test Case1:
Input:
12
5
Output:
17
7
60
2.4
2
2 Arithmetic
FCP004 Operators No
Write a program to take two numbers A and B from the user and calculate the quotient and remainder when number A is divided by
number B.

Note: Print the output in the order as mentioned in the question.

Test Case1:
Input:
12
5
Output:
2
2

Test Case2:
Input:
15
6
Output:
2
3 Arithmetic
FCP005 Operators No
Write a program to take a positive number from the user and then display the last digit of that number.

Test Case1:
Input:
843
Output:
3

Test Case2:
Input:
321
Output:
1 Arithmetic
FCP006 Operators No
Write a program to convert a temperature from Celsius to Fahrenheit using the formula C/5 = (F-32)/9

Test Case1:
Input:
30
Output: Arithmetic
FCP007 86 Operators No
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take two inputs from the user and swap them without using a temporary or third variable.

Test Case1:
Input:
2
3
Output:
3
2 Arithmetic
FCP008 Operators No
Write a program to take two numbers, A and B from the user. Your task is to find the largest number that is less than A and can be
divided evenly by B. Can you figure out that number?

Test Case1:
Input:
15
4
Output:
12

Test Case2:
Input:
27
5
Output:
25 Arithmetic
FCP009 Operators No
Write a program to take two numbers from the user and determine the greater of those two given numbers.

Test Case1:
Input:
20
3
Output:
20

Test Case2:
Input:
5
7
Output:
FCP010 7 Conditions No
Write a program to take a number from the user and print that number as Odd or Even.

Test Case1:
Input:
56
Output:
Even

Test Case2:
Input:
87
Output:
FCP011 Odd Conditions No
Write a program to take a number from the user and output whether that number is negative, positive or zero.

Test Case1:
Input:
6
Output:
Positive

Test Case2:
Input:
0
Output:
FCP012 Zero Conditions No
Write a program to take an integer as input and print the smallest positive integer that is a multiple of both 2 and n.

Test Case:
Input:
5
Output:
10

Test Case:
Input:
6
Output:
6
FCP013 Conditions No Yes
Write a program to take three numbers from the user and print the greater number of the three numbers. (Assume all three numbers
are distinct)

Test Case1:
Input:
20
3
43
Output:
FCP014 43 Conditions Yes Yes Anzum
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take four numbers from the user and print the greater number of the four numbers. (assume all the numbers are
distinct).

Test Case1:
Input:
98
13
29
58
Output:
FCP015 98 Conditions Yes Yes Sayali
Write a program to take a year from the user and output whether a given year is a leap year or not.

Note: A year is said to be a leap year if it is either divisible by 400 or it should be divisible by 4 and not by 100.

Test Case1:
Input:
1800
Output:
No

Test Case2:
Input:
2000
Output:
Yes

Test Case3:
Input:
2024
Output:
FCP016 Yes Conditions No
Write a program to take 3 numbers from the user and output the second max of 3 numbers.
(First, do it in the normal way then do it by using 3 comparisons)

Test Case1:
Input:
5
4
6
Output:
FCP017 5 Conditions No
Write a program to take the basic salary of an employee and calculate its Gross salary according to the following: (Gross salary is the sum
of basic salary, HRA, and DRA)
Basic Salary <= 10000 : HRA = 20%, DA = 80%
Basic Salary <= 20000 : HRA = 25%, DA = 90%
Basic Salary > 20000 : HRA = 30%, DA = 95%

Test Case1:
Input:
17000
Output:
36550
Explanation:
Since the basic salary lies in the bracket 10000 <= basic salary <= 20000, the HRA equals 25% of the salary = 4250, and the DRA equals
90% of the basic salary = 15300. Hence the total salary is 17000+15300+4250 = 36550
FCP018 Conditions No
Write a program to input electricity unit charges and calculate the total electricity bill according to the given condition:
For the first 50 units Rs. 0.50/unit
For the next 100 units Rs. 0.75/unit
For the next 100 units Rs. 1.20/unit
For units above 250 Rs. 1.50/unit
An additional surcharge of 20% is added to the bill

Test Case1:
Input:
200
Output:
192
FCP019 Conditions No
Write a program to take 4 numbers from the user and output the second max of these 4 numbers.

Test Case1:
Input:
5
4
6
7
Output:
6
FCP020 Conditions Yes Yes Khaja
Write a program to take 8 numbers from the user and output the second max of these 8 numbers.

Test Case1:
Input:
5
4
6
7
8
9
2
3
Output:
FCP021 8 Conditions No
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take 5 numbers from the user and print the frequency of every number.

Test Case1:
Input:
3
4
6
3
6

Output:
3=2
4=1
6=2
FCP022 Conditions No
Take the number N and the name from the user as inputs, and print the name N times.

Test Case1:
Input:
2
Badanti
Output:
Bedanti
FCP023 Bedanti loops No
Take a number N from the user as input, and print even numbers up to N.

Test Case1:
Input:
10
Output:
FCP024 2 468 loops No
Write a program to print the sum of odd numbers up to N.

Test Case1:
Input:
20
Output:
100
FCP025 loops No
Write a program to take two integers M, and N and print the sum of numbers in the range M to N.

Test Case1:
Input:
2
7
Output:
27
Explanation:
FCP026 Output should be 27 as the sum of numbers (2+3+4+5+6+7=27) loops No
Write a program to calculate the sum of the following series where N is input from the user. 1 + 1/2 + 1/3 + 1/4 + 1/5 +…………1/N

Test Case1:
Input:
4
Output:
FCP027 2.08 loops No
Write a program to take a number from the user and print the number digits in the given number.

Test Case1:
Input:
456
Output:
FCP028 3 loops No
Write a program to take a number from the user and print the sum of the digits of the given number.

Test Case1:
Input:
456
Output:
15
Explanation:
FCP029 4+5+6 = 15 loops No Exist
Write a program to input a number and check whether it is a perfect square or not.

Note: A perfect square is the product of some integer with itself.

Test Case1:
Input:
16
Output:
Yes

Test Case2:
Input:
14
Output:
FCP030 No loops No Exist Yes
Write a program that takes a number from the user and prints the number that is formed by reversing the digits of the number.

Test Case1:
Input:
123
Output:
FCP031 321 loops No
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take a number and if a number has exactly three positive divisors Or not. An integer m is a divisor of n if an integer k
exists such that n = k * m.

Test Case1:
Input:
2
Output:
No

Test Case2:
Input:
4
Output:
Yes
FCP032 loops No Yes
Write a program to check whether a number is palindrome or not.

Note: A palindrome is a sequence of characters (or numbers) that reads the same
forwards as it does backwards. In other words, it remains unchanged when reversed.

Test Case1:
Input:
242
Output:
Yes

Test Case2:
Input:
1351
Output:
No
FCP033 loops Yes Yes Yes Nigma
Write a program to take a number from the user and print all the factors of the given number. A factor is a number that can divide
another number evenly without leaving a remainder.

Test Case1:
Input:
12
Output:
1
2
3
4
6
12

Test Case2:
Input:
25
Output:
1
5
FCP034 25 loops No Exist
Write a program to check if a number is a special type of number called a 'prime number'. A prime number is a number that is only
divisible by 1 and itself, and it doesn't have any other factors.
For example, the number 7 is a prime number because it can only be divided by 1 and 7 without leaving a remainder. However, the
number 12 is not a prime number because it has other factors, such as 2, 3, 4, and 6, in addition to 1 and 12. (Take the number from the
user)?

Test Case1:
Input:
97
Output:
Yes

Test Case2:
Input:
49
Output:
FCP035 No loops Yes Yes Chhotu
Write a program to take two numbers from the user as input and obtain the HCF and LCM of the two numbers.

Test Case1:
Input:
12
15
Output:
3
FCP036 60 loops Yes Exist
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take a number from the user and then determine if that number is a special type of number called a 'perfect
number'.
A perfect number is a number where the sum of all its factors (excluding the number itself) is equal to the number itself. Print Yes if the
number is a perfect number else print No.

Test Case1:
Input:
6
Output:
Yes
Explanation:
The program takes the number 6 as input. It then calculates the factors of 6, which are 1, 2, and 3. The sum of these factors (1 + 2 + 3) is
equal to 6, so 6 is a perfect number.

Test Case2:
Input:
12
Output:
No
Explanation:
The program takes the number 12 as input. It calculates the factors of 12, which are 1, 2, 3, 4, and 6. The sum of these factors (1 + 2 + 3 +
4 + 6)
FCP037 is equal to 16, which is not equal to 12. Therefore, 12 is not a perfect number. loops Yes Yes Yes Mahima
Write a program to check whether a number is Armstrong or not. (Armstrong number is a number that is equal to the sum of cubes of its
digits, for example, 153 = 1^3 + 5^3 + 3^3.)

Test Case1:
Input:
370
Output:
Yes

Test Case2:
Input:
121
Output:
No
FCP038 loops No
Write a program to take N numbers from a user as input, and print the maximum and minimum values among the given set of N
numbers. Also, take N from the user as input.

Test Case1:
Input:
5
10
5
8
3
12
Output:
12
FCP039 3 loops Yes Yes kalyani
Write a program to take N numbers from a user as input, and print the second maximum number among the given set of N numbers.
Also, take N from the user as input.

Test Case1:
Input:
5
10
5
8
3
12
Output:
10
FCP040 loops Yes Exist
Write a program to take N numbers from a user as input, and print the third maximum number among the given set of N numbers. Also,
take N from the user as input.

Test Case1:
Input:
5
11
51
18
33
12
Output:
FCP041 18 loops No
Write a program to print the first 'N' Fibonacci numbers. Take N from the user as input.

Fibonacci numbers are a series of numbers where each number is the sum of the two preceding numbers. We start with the numbers 0
and 1, and then calculate and print each subsequent Fibonacci number by adding the previous two numbers. For example, the third
Fibonacci number is obtained by adding the first two numbers: 0 + 1 = 1. The fourth Fibonacci number can be obtained by adding the
previous two numbers.

Test Case1:
Input:
7
Output:
FCP042 0112358 loops No Yes
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to print the sum of a given number of terms (N) for a given value of X in the following mathematical series: (Input X and
N from the user)

i) X+(X^2)/2+(X^3)/3+(X^4)/4 ....upto N terms

Test Case1:
Input:
2
6
Output:
27.73
Explanation:
if user entered X = 2 and N= 6 then series will become: 2+(2^2)/2+(2^3)/3+(2^4)/4+(2^5)/5+(2^6)/6 then output will be 27.73

ii) X-(X^3)/3+(X^5)/5-(X^7)/7+(X^9)/9-.... upto N terms

Test Case1:
Input:
2
6
Output:
-141.84
Explanation:
if user entered X = 2 and N= 6 then series will become:
2-(2^3)/3+(2^5)/5-(2^7)/7+(2^9)/9-(2^11)/11 then the output will be -141.84

iii) X-(X^3)/3!+(X^5)/5!-(X^7)/7!+ .... upto N terms

Test Case1:
Input:
2
6
Output:
0.9092
Explanation:
if user entered X = 2 and N= 6 then series will become:
FCP043 2-(2^3)/3!+(2^5)/5!-(2^7)/7!+(2^9)/9!-(2^11)/11! then the output will be 0.9092 loops Yes Yes Pritesh
Write a program to take value N from the user and print the following pattern based on the user input.
1) N=5
*
**
***
****
*****

2) N=5
*
**
***
****
*****

3) N=5
*****
****
***
**
*

4) N=4
1
23
456
7 5 9 10

5) N=4
0
24
488
8 16 16 16

6) N=5
1
121
12321
1234321
123454321
FCP044 Nested loops Yes Yes Anzum
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take a number N from the user and print the following pattern with the input given by the user:
1) N=4
*
***
*****
*******

2) N=4
*
***
*****
*******
*****
***
*
3) N=4
* *
** **
*** ***
********
*** ***
** **
* *

4) N=4
4
434
43234
4321234
43234
434
4

5)N = 5
0 0 0 0 0
x 0 0 0 x
x x 0 x x
x 0 0 0 x
0 0 0 0 0

6)N=4
45432
FCP045 34543 Nested loops Yes Yes Amit
2 3 4 5a4program to take a number N from the user and print the following pattern with the input given by the user:
Write
1
1)2N=5
345
*
**
7)N=4
* *
*4_4_3_2
*
*3_4_3
****
2_4
1
2) N=6
* *2_4
****
*3_4_3 *
4_4_3_2
* *
* *
* *
******

3) N=4
*
* *
* *
* *
* *
* *
*

4) N=4
****
* *
* *
*
* *
* *
****
FCP046 Nested loops Yes Yes Meenakshi
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take N numbers from the user and print the Highest Common Factor (HCF) of the given set of numbers. Take N from
the user as input.

Test Case1:
Input:
4
12
18
24
30
Output:
6
Explanation:
In this test case, the user inputs four numbers: 12, 18, 24, and 30. The program then calculates the HCF of these numbers, which is found
to be 6. This means that 6 is the largest number that can divide all the given numbers (12, 18, 24, and 30) without leaving a remainder.

Test Case2:
Input:
3
16
28
40
Output:
4
Explanation:
In this test case, the user inputs three numbers: 16, 28, and 40. The program then calculates the HCF of these numbers, which is found to
FCP047 be 4. This means that 4 is the largest number that can divide all the given numbers (16, 28, and 40) without leaving a remainder. Nested loops Yes Exist
Write a program to print all Armstrong numbers in a given range of M to N.

Test Case1:
Input:
100
1000
Output:
153
370
371
407
FCP048 Nested loops Yes Yes Tanuja
Write a program
Test Case 2: to take a number and print the count of the prime numbers that are strictly less than a number.
Input:
Testcase
1 1:
Input:
500
10
Output:
Output:
1
4
2
Explanation:
3
There
4 are 4 prime numbers less than 10, they are 2, 3, 5, 7.
5
Testcase
6 2:
Input:
7
0
8
Output:
9
0
153
370
Testcase
371 3:
Input:
407
2
Output:
Test Case 3:
FCP049 0
Input: Nested loops Yes Yes Yes Pooja
1000 a program to print only the prime factors of a given number 'N'. Take N from the user as input.
Write
2000 Prime factors are the prime numbers that divide a given number without leaving a remainder.
Note:
Output:
1634Case:
Test
Input:
Test Case 4:
84
Input:
500
Output:
800
2
Output:
3
547
7

Test Case 5:
Explanation:
Input:
In this test case, the number given is 84. The program calculates and displays the prime factors of 84, which are 2, 3, and 7. These prime
FCP050 200
numbers can divide 84 without leaving a remainder. Nested loops Yes Yes Chhotu
800
Take a number N from the user as input and repeatedly find the sum of the digits of the number till you get a single digit. Print that digit.
Output:
Example: 678 -> 6+7+8 = 21 -> 2+1 = 3
370
371
Test Case 1:
407
Input:
547
483
Test Case 6:
Output:
Input:
6
1000
10000
Test Case 2:
Output:
Input:
1634
837
8208
9474
Output:
9
FCP051 Nested loops Yes Yes Yes Sayali
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to print all the numbers from the given array using a loop.
L = {23, 45, 32, 25, 46,33, 71, 90}

Output:
23
45
32
25
46
33
71 Arrays (1-D & 2-
FCP052 90 D) No
Arrays (1-D & 2-
FCP053 Write a program to create an array of natural numbers till 20 and print it. D) No
Write a program to reverse the array and print the reversed array.

Test Case1:
Input:
23 45 32 25 46 33 71 90
Output:
90
71
33
46
25
32
45 Arrays (1-D & 2-
FCP054 23 D) No
Write a program to take size of array, array and target as input from the user and check whether the target exists in this array or not.

Test Case1:
Input:
7
1234567
3
Output:
Yes

Test Case2:
Input:
8
Output: Arrays (1-D & 2-
FCP055 No D) No Exist
Write a program to print the sum of all the odd numbers and even numbers in the given array.
Note: In the output, you should print odd numbers sum and even numbers sum in this order only.

Test Case1:
Input:
23 45 32 25 46 33 71 90
Output:
197 Arrays (1-D & 2-
FCP056 168 D) No
Write a program to take N numbers from a user as input and store them in an array and then take another number from the user M, and
delete the Mth element from the array. Print the final array.
Note - (Do not use another array)

Test Case 1:
Input:
5
24263
3
Output:
2463

Test Case 2:
Input:
6
246339
2
Output:
26339 Arrays (1-D & 2-
FCP057 D) Yes Yes Vinay
Write a program to take N numbers from a user as input and then take another number from the user M, and a number X from the user
to be inserted at the Mth location in the array. Print the final array.
Note - (Do not use another array)

Test Case 1:
Input:
5
24263
3
9
Output:
249263

Test Case 2:
Input:
6
24633
2
8
Output: Arrays (1-D & 2-
FCP058 284633 D) Yes Yes
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take N numbers from a user as input and then print the duplicates in those N numbers. Also, take N as an input from
the user.

Test Case 1:
Input:
5
24263
Output:
2

Test Case 2:
Input:
6
246332
Output:
32 Arrays (1-D & 2-
FCP059 D) Yes Yes Mahima
Write a program to take input n from the user and print Pascal's triangle of n rows.
Test Case 1:
Input:
4
Output:
1
121
1331
14641
Arrays (1-D & 2-
FCP060 Test Case 2: D) Yes Yes Tanuja
Input:a6program to take N numbers from the user and print the frequency of every number.
Write
Output:
1 Case 1:
Test
121
Input:
1331
6
142
2 66 43
16
1 5 10 10 5 1
Output:
1 -6215 20 15 6 1
2
4-1
Test
6 - 2 Case 3:
Input:
3 -1 1 Arrays (1-D & 2-
FCP061 Output: D) Yes Yes Khaja
1
Write a program that rotates the elements of a list so that the elements at the first index move to the second elements at the second
index move to the third and so on. The last element moves at the first index. (Take array and no_of_rotations from the user)
Test Case 4:
Input: 7
Test Case1:
Output:
Input:
1
12345
1
221
1331
Output:
1
34465411
2
1 5 10 10 5 1
1 6 15
Test 20 15 6 1
Case2:
1 7 21 35 35 21 7 1
Input:
12345
Test
5 Case 5:
Input: 0
Output: Arrays (1-D & 2-
FCP062 Output:
12345 D) Yes Yes Yes Nigma
Write a program to take a binary array which contains 0 and 1, and print the maximum number of consecutive 1's in the array.
Test Case 6:
Testcase
Input: 3 1:
Input:
Output:
1
110111
Output:
121
133 3 1
Explanation:
The
Test first
Casetwo
7: digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.
Input: 8
Testcase
Output: 1:
Input:
1
1
1021
1101
Output:
1331 Arrays (1-D & 2-
FCP063 2
14641 D) Yes Yes Yes Nigma
Write
1 5 10a10
program
51 to take two sorted arrays of size M, N from the user as input and merge them into a single sorted array of size M+N (Do
not use20sorting)
1 6 15 15 6 1
1 7 21 35 35 21 7 1
Test Case1:
1 8 28 56 70 56 28 8 1
Input:
1 2 5Case
Test 6 8:
3 4 7 95
Input:
Output: Arrays (1-D & 2-
FCP064 12345679 D) Yes Yes Yes Mahima
1 2 1 a program, to take two sorted arrays of size M and N from the user as input and return the median of the two sorted arrays.
Write
1331
1 4 6Case1:
Test 41
1 5 10 10 5 1
Input:
13
Test Case 9:
2
Input: 2
Output:
Output:
2.0
1
1 2 1Case2:
Test
Input:
Test
1 2 Case 10:
Input:
3 4 10
Output:
Output: Arrays (1-D & 2-
FCP065 1
2.5 D) No
121
1331
14641
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
1 9 36 84 126 126 84 36 9 1
1 10 45 120 210 252 210 120 45 10 1
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take two sorted arrays from the user as input and find the Union and Intersection of the arrays.

Test Case1:
Input:
13457
2356
Output:
1234567
35 Arrays (1-D & 2-
FCP066 D) Yes Yes Kalyani
Take N numbers from the user as input and print them in an ascending order.
Use the following algorithms to sort the array -
Selection Sort
Insertion Sort Arrays (1-D & 2-
FCP067 Bubble Sort D) No
Write a program to take an unsorted array of size N that contains only non-negative integers, and find a contiguous subarray that adds to
a given number S. In case of multiple subarrays, return the subarray which comes first on moving from left to right. Let us say the array is
3, 6, 7, 5, 10. And the value of S = 12. The output should be: 7, 5

Test Case1:
Input:
3 6 7 5 10
12
Output: Arrays (1-D & 2-
FCP068 75 D) Yes Yes Yes Pritesh
Write a program to take an array of size N and a number K from the user as input, and print the elements of an array in a rotated manner
with a gap of K. Eg, let us say the array is 3, 6, 7, 5, 10. And the value of k = 3. The output should be - 7, 3, 10, 6, 5. If k = 2, the output
should be 6, 5, 3, 10, 7

Test Case1:
Input:
3 6 7 5 10
3
Output:
7 3 10 6 5

Test Case2:
Input:
3 6 7 5 10
2
Output:
6 5 3 10 7 Arrays (1-D & 2-
FCP069 D) Yes Yes Amit
Write a program to take a sorted array from the user as input and find a number using the Binary Search algorithm.

Test Case1:
Input:
12345
5
Output: Arrays (1-D & 2-
FCP070 Yes D) Yes Yes Pritesh

Write a program to take value N from the user and print the following pattern based on the user input.
array = [2, 3, 5, 2, 1]
>>
>>>
>>>>>
>> Arrays (1-D & 2-
FCP071 > D) Yes Yes Kalyani

Write a program to take value N from the user and print the following pattern based on the user input.
array = [2, 3, 5, 2, 1]

*
*
* *
* * * *
* * * * * Arrays (1-D & 2-
FCP072 D) Yes Yes Pooja
Write a program to add two matrices and store them in a separate matrix.

Test Case1:
Input:
Matrix 1:
1 2 3
4 5 6
7 8 9
Matrix 2:
9 8 7
6 5 4
3 2 1
Output:
10 10 10
10 10 10 Arrays (1-D & 2-
FCP073 10 10 10 D) Yes Yes Chhotu
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to subtract two matrices and store them in a separate matrix.

Test Case1:
Input:
Matrix 1:
1 2 3
4 5 6
7 8 9
Matrix 2:
9 8 7
6 5 4
3 2 1
Output:
-8 -6 -4
-2 0 2
4 6 8 Arrays (1-D & 2-
FCP074 D) No
Write a program to transpose matrix A. Store the result in a separate matrix.

Test Case1:
Input:
123
456
789
Output:
147
258
369 Arrays (1-D & 2-
FCP075 D) No
Write a program to find the minimum element in the matrix.

Test Case1:
Input:
5 12 7
9 15 2
8 10 3
Output:
2 Arrays (1-D & 2-
FCP076 D) No
Write a program to take an odd number N from the user and print a magic square of N x N size filling it from 1 to N^2.

Test Case1:
Input:
3
Output:
816
357 Arrays (1-D & 2-
FCP077 492 D) Yes Yes Sayali
Write a program to take the input from the user and print the following pattern according to the input.

Test Case1:
Input:
3
Output:
123
894
765

Test Case2:
Input:
4
Output:
1 2 3 4
12 13 14 5
11 16 15 6 Arrays (1-D & 2-
FCP078 10 9 8 7 D) Yes Yes Yes Khaja
Write a program to take two numbers as input each in a different array. Each digit of the number should be in an element in the array.
calculate their sum in another array such that each digit is stored as an array element and print the sum.

Testcase1:
Input:
589
876
Output:
1465
Explanation:
The sum of numbers 589 and 876 is 1465.

Testcase2:
Input:
9786
875
Output:
10661
Explanation:
The sum of numbers 9786 and 875 is 10661. Arrays (1-D & 2-
FCP079 D) No
 CONVERT
PROBLEM INTO ADD TO MAKE TEST
CODE PROGRAMS SECTION PROGRAMS CODECHEF LEETCODE CASES
Write a program to take two numbers as input each in a different array. Each digit of the number should be in an element in the array.
calculate their product in another array such that each digit is stored as an array element and print the product.

Testcase1:
Input:
367
76
Output:
27892
Explanation:
The product of numbers 367 and 76 is 27892.

Testcase2:
Input:
978
871
Output:
851838
Explanation:
The product of numbers 978 and 871 is 851838.

Testcase3:
Input:
1234
4321
Output:
5332114
Explanation:
The product of numbers 1234 and 4321 is 5332114

Testcase4:
Input:
56789
98765
Output:
5608765585
Explanation:
The product of numbers 56789 and 98765 is 5608765585

Testcase5:
Input:
123
1
Output:
123
Explanation:
The product of numbers 123 and 1 is 123.

Testcase6:
Input:
8026
100
Output:
802600
Explanation:
The product of numbers 8026 and 100 is 802600

Testcase7:
Input:
1000
500
Output:
500000
Explanation:
The product of numbers 1000 and 500 is 500000

Testcase8:
Input:
232323
268
Output:
62262564
Explanation:
The product of numbers 232323 and 268 is 62262564

Testcase9:
Input:
99
4
Output:
396
Explanation:
The product of numbers 99 and 4 is 396

Testcase10:
Input:
5
0
Output:
0
Explanation: Arrays (1-D & 2-
FCP080 The product of numbers 5 and 0 is 0 D) Yes Yes Tanuja
 PROBLEM
CODE FCP001 FCP002 FCP003 FCP004 FCP005 FCP006 FCP007 FCP008 FCP009 FCP010 FCP011 FCP012 FCP013 FCP014 FCP015 FCP016 FCP017 FCP018 FCP019 FCP020 FCP021 FCP022 FCP023 FCP024 FCP025 FCP026 FCP027 FCP028 FCP029 FCP030 FCP031 FCP032 FCP033 FCP034 FCP035 FCP036 FCP037 FCP038 FCP039 FCP040 FCP041 FCP042 FCP043 FCP044 FCP045 FCP046 FCP047 FCP048 FCP049 FCP050 FCP051 FCP052 FCP053 FCP054 FCP055 FCP056 FCP057 FCP058 FCP059 FCP060 FCP061 FCP062 FCP063 FCP064 FCP065 FCP066 FCP067 FCP068 FCP069 FCP070 FCP071 FCP072 FCP073 FCP074 FCP075 FCP076 FCP077 3 6 14 20 7 27
Topic --> Variables and Variables and Variables and Arithmetic Arithmetic Arithmetic Arithmetic Arithmetic Arithmetic Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Arrays (1-D & 2- Flowcharts Flowcharts Variables and Arithmetic Arrays (1-D & 2-
Name / Email Input/Output Input/Output Input/Output Operators Operators Operators Operators Operators Operators Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions Conditions loops loops loops loops loops loops loops loops loops loops loops loops loops loops loops loops loops loops loops loops Nested loops Nested loops Nested loops Nested loops Nested loops Nested loops Nested loops D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) D) solved Solved % Attempted Rank Input/Output Operators Conditions loops Nested loops D)
Student1 [email protected] Attempted Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Solved Unsolved Solved Attempted Attempted Solved 7 9% 5 9 33% 17% 36% 30% 29% 41% 26 34.21052632
Student2 [email protected] Solved Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted 6 8% 7 19 67% 0% 7% 15% 29% 30%
Student3 [email protected] Attempted Attempted Solved Solved Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted 3 4% 10 29 33% 50% 64% 60% 100% 44%
Student4 [email protected] Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted 8 10% 5 4 33% 33% 64% 50% 57% 56%
Student5 [email protected] Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Attempted Attempted 7 9% 6 9 67% 33% 57% 55% 57% 52%
Student6 [email protected] Attempted Solved Solved Attempted Solved Solved Solved Attempted Attempted Solved Attempted Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved 9 12% 4 1 67% 50% 50% 50% 29% 56%
Student7 [email protected] Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Attempted 6 8% 7 19 33% 50% 43% 50% 43% 44%
Student8 [email protected] Solved Attempted Solved Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved 8 10% 5 4 67% 50% 21% 35% 29% 44%
Student9 [email protected] Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Solved 7 9% 6 9 67% 33% 43% 50% 71% 52%
Student10 [email protected] Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Solved Solved Solved 9 12% 4 1 0% 50% 29% 30% 29% 48%
Student11 [email protected] Solved Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Solved Solved Solved Attempted Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Solved Attempted Attempted 4 5% 9 25 33% 50% 64% 60% 71% 44%
Student12 [email protected] Solved Attempted Attempted Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved 8 10% 5 4 33% 67% 64% 70% 71% 63%
Student13 [email protected] Solved Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Attempted Attempted 7 9% 6 9 100% 67% 36% 50% 43% 48%
Student14 [email protected] Attempted Solved Solved Solved Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved 6 8% 7 19 67% 83% 50% 60% 43% 48%
Student15 [email protected] Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Solved 7 9% 6 9 67% 50% 64% 65% 86% 59%
Student16 [email protected] Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Attempted 7 9% 6 9 33% 17% 21% 20% 29% 37%
Student17 [email protected] Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Attempted Solved Solved Attempted 8 10% 5 4 67% 50% 43% 40% 57% 52%
Student18 [email protected] Solved Solved Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Attempted Solved 7 9% 6 9 67% 83% 64% 60% 29% 52%
Student19 [email protected] Solved Solved Solved Attempted Attempted Solved Solved Solved Solved Solved Solved Attempted Solved Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved 9 12% 4 1 100% 67% 71% 65% 43% 63%
Student20 [email protected] Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved 6 8% 7 19 0% 50% 64% 65% 57% 52%
Student21 [email protected] Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Solved Attempted Attempted Solved Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted 6 8% 7 19 33% 50% 50% 50% 57% 48%
Student22 [email protected] Solved Solved Attempted Attempted Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted 6 8% 7 19 67% 50% 64% 65% 57% 52%
Student23 [email protected] Solved Attempted Solved Solved Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Attempted 7 9% 6 9 67% 83% 50% 50% 29% 48%
Student24 [email protected] Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Solved Solved Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved 8 10% 5 4 0% 83% 50% 55% 43% 56%
Student25 [email protected] Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Attempted Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted 4 5% 9 25 67% 0% 36% 25% 43% 30%
Student26 [email protected] Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Solved Attempted Solved Attempted Solved Attempted 7 9% 6 9 33% 50% 50% 55% 57% 52%
Student27 [email protected] Attempted Attempted Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Solved Solved Solved Solved Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved Attempted Solved Solved Attempted 4 5% 9 25 33% 33% 64% 55% 86% 44%
Student28 [email protected] Attempted Solved Attempted Attempted Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved Solved Solved Attempted Solved Solved Attempted Solved Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Attempted Solved Attempted Attempted Solved 2 3% 11 30 33% 50% 71% 60% 57% 37%
Student29 [email protected] Solved Solved Solved Solved Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Attempted Solved Solved Solved Solved Attempted Attempted Attempted Solved Solved Attempted Attempted Attempted Attempted Attempted Attempted Solved Solved Attempted Attempted Solved Attempted Attempted Attempted Attempted Solved 4 5% 9 25 100% 83% 43% 50% 29% 37%
Student30 [email protected] Solved Attempted Attempted Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Solved Solved Solved Attempted Solved Attempted Attempted Attempted Solved Attempted Solved Attempted Solved Attempted Solved Attempted Solved Solved Attempted Attempted Solved 7 9% 6 9 33% 67% 64% 55% 43% 52%
 Rank
Topic --> Flowcharts Solved Flowcharts based on Variables and Arithmetic Condition Nested Arrays (1-D
Name / Email solved % Attempted Solved % Input/Output Operators s loops loops & 2-D)
Student6 [email protected] 9 12% 4 1 67% 50% 50% 50% 29% 56%
Student10 [email protected] 9 12% 4 1 0% 50% 29% 30% 29% 48%
Student19 [email protected] 9 12% 4 1 100% 67% 71% 65% 43% 63%
Student4 [email protected] 8 10% 5 4 33% 33% 64% 50% 57% 56%
Student8 [email protected] 8 10% 5 4 67% 50% 21% 35% 29% 44%
Student12 [email protected] 8 10% 5 4 33% 67% 64% 70% 71% 63%
Student17 [email protected] 8 10% 5 4 67% 50% 43% 40% 57% 52%
Student24 [email protected] 8 10% 5 4 0% 83% 50% 55% 43% 56%
Student1 [email protected] 7 9% 5 9 33% 17% 36% 30% 29% 41%
Student5 [email protected] 7 9% 6 9 67% 33% 57% 55% 57% 52%
Student9 [email protected] 7 9% 6 9 67% 33% 43% 50% 71% 52%
Student13 [email protected] 7 9% 6 9 100% 67% 36% 50% 43% 48%
Student15 [email protected] 7 9% 6 9 67% 50% 64% 65% 86% 59%
Student16 [email protected] 7 9% 6 9 33% 17% 21% 20% 29% 37%
Student18 [email protected] 7 9% 6 9 67% 83% 64% 60% 29% 52%
Student23 [email protected] 7 9% 6 9 67% 83% 50% 50% 29% 48%
Student26 [email protected] 7 9% 6 9 33% 50% 50% 55% 57% 52%
Student30 [email protected] 7 9% 6 9 33% 67% 64% 55% 43% 52%
Student2 [email protected] 6 8% 7 19 67% 0% 7% 15% 29% 30%
Student7 [email protected] 6 8% 7 19 33% 50% 43% 50% 43% 44%
Student14 [email protected] 6 8% 7 19 67% 83% 50% 60% 43% 48%
Student20 [email protected] 6 8% 7 19 0% 50% 64% 65% 57% 52%
Student21 [email protected] 6 8% 7 19 33% 50% 50% 50% 57% 48%
Student22 [email protected] 6 8% 7 19 67% 50% 64% 65% 57% 52%
Student11 [email protected] 4 5% 9 25 33% 50% 64% 60% 71% 44%
Student25 [email protected] 4 5% 9 25 67% 0% 36% 25% 43% 30%
Student27 [email protected] 4 5% 9 25 33% 33% 64% 55% 86% 44%
Student29 [email protected] 4 5% 9 25 100% 83% 43% 50% 29% 37%
Student3 [email protected] 3 4% 10 29 33% 50% 64% 60% 100% 44%
Student28 [email protected] 2 3% 11 30 33% 50% 71% 60% 57% 37%