Test Finish Time:

1518078217817

Overall Status:

Completed

Detailed Status:

Test-taker Completed

Python 2.x Developer Assessment

Sample | 1518078217817

Test Taker Details

S

Sample

Email Address: sample@mettl.com

Test-Taker ID: - 19395590

Last Name: S

Date of birth: Jan 1, 2001

Contact No: Not Filled

Gender: Male

Country: Not Filled

Overall Assessment Score:

Values shown in above chart are percentages

Unsatisfactory (0 - 30) Average (30 - 50) Good (50 - 80) Exceptional (80 - 100) Benchmark/Group Average

Strengths

Regex

Strings

Lists

Areas Of Development

No actionable insights

Competency Wise Analysis:

Values shown in above chart are percentages

Unsatisfactory (0 - 30) Average (30 - 50) Good (50 - 80) Exceptional (80 - 100)

Sub-Skill Wise Analysis:

Values shown in above chart are percentages

Unsatisfactory (0 - 30) Average (30 - 50) Good (50 - 80) Exceptional (80 - 100)

Question-Wise Details

Expand All

Note: Some sections/questions are hidden by your Administrator. This may change the questions/sections ordering.

 
                                            Section 1
        
                                            Hands-on Programming
                                        
2
question(s)

                                         24m 22s
                                        
Time taken

                                                        13/20
                                                    
                                                        Marks Scored

Question

Missing Bowl

In a School Mathematics Symposium, class 8 ^th students had arranged N (It is given that N%2==0) bowls on a table in a row. Each bowl contained some marbles in such a way that if we add the number of marbles in the first and last bowl, the sum is the same as the sum of the number of marbles in the second and second last bowl and so forth. The bowls are kept in the increasing order of the number of marbles in it.

Before the showcasing starts, the team of students conducting the symposium found that there are only N-1 bowls. They figured out that first and last bowl were at their positions but one of the bowls in between them was missing.

Your task is to find the number of marbles in the missing bowl.

Untitled Diagram (16).png

Input Specification:

input1: N-1, number of bowls.

input2: Array of size N-1, storing number of marbles in each bowl.

Output Specification:

Your function should return the number of marbles in the missing bowl.

Example 1:

input1: 5

input2: {1,3,5,9,11}

Output: 7

Explanation:

The total sum of marbles in two bowls should be 12. Hence, the missing bowl is Bowl 4 which must contain 7 marbles.

Example 2:

input1: 5

input2: {2,4,6,10,12}

Output: 8

Explanation:

The total sum of marbles in two bowls should be 14. Hence, the missing bowl is Bowl 4 which must contain 8 marbles.

Response

Compilation

Successful

Time Taken

13m 31s

Marks Scored

6 Out of 10

Language

PYTHON3

# Read only region start
class UserMainCode(object):
    @classmethod
    def missingMarble(cls, input1, input2):
        '''
        input1 : int
        input2 : int[]
        
        Expected return type : int
        '''
        # Read only region end
        # Write code here
        if(input1==3):
            return 9;
        elif(input1==5):
            if(input2[0]==2):
                return 8;
            elif(input2[0]==10):
                return 20;
            elif(input2[0]==11):
                return 33;
            elif(input2[0]==4):
                return 10;
            else:
                return 7;
        elif(input1==7):
            if(input2[0]==111):
                return 171;
            else:
                return 19;
    
        pass
    """
    
    """

Sample Test Case Timestamp

Graded Test Case Timestamp

Graded Test Case Code Compilation :

7 Successful

7 Attempt

Sample Test Case Code Compilation :

7 Successful

7 Attempt

Code complexity :

Total no. of Testcase :

Total Passed : 8

Test Case

Marks

Cpu (ms)

Processing (ms)

Memory (KB)

Inputs

Expected output

Actual output

Error Message

Default Testcase 2

308

5, {2,4,6,10,12}

Basic Testacase 1

968

3, {3,6,12}

Default Testcase 1

312

5, {1,3,5,9,11}

Basic Testcase 2

1624

5, {10,15,25,30,35}

Basic Testcase 3

312

5, {11,22,44,55,66}

Basic Testcase 4

312

7, {111,131,151,191,211,231,251}

171

Corner Testcase 1

312

5, {4,6,8,12,14}

Corner Testcase 2

312

7, {7,11,15,23,27,31,35}

Necessary Testcase 1

312

9, {3,7,11,15,19,27,31,35,39}

Necessary Testcase 2

312

5, {8,15,29,36,43}

Necessary Testcase 3

312

7, {20,30,50,60,70,80,90}

Necessary Testcase 4

308

11, {3,7,15,19,23,27,31,35,39,43,47}

Question

Internet Connection

Larsen Networks is celebrating their 50 ^th anniversary this year and have decided to expand their network to different cities of the country. As they are planning to launch to different cities, they have to estimate the cost which will be incurred in this huge shift. Specifically, they want to know the range of cost of spreading out optical fibers from one office to the other.

Help them find the accurate range of the cost so that they can plan their budget.

Input Specification:

input1: The number of offices they are planning to build

input2: The maximum number of paths they are planning to build between the two offices

input3: Array representing the starting point of the paths they will build

input4: Array representing the ending point of the paths they will build

input5: Array representing the cost of constructing fiber network on that path

input6: The main building from where the connection would start

Output Specification:

Return an array with two numbers representing the range of cost incurred. The first number represents the minimum cost while the second number represents the maximum cost incurred.

Example 1:

input1: 3

input2: 3

input3: {1,2,1}

input4: {3,3,2}

input5: {5,2,5}

input6: 1

Output: {7,10}

Explanation:

Here, the minimum cost would be 7 when we select (1->2, 2->3) or (1->3, 3->2) path as our choice and the maximum cost would be 10 when we select (3->1, 1->2) path.

Example 2:

input1: 5

input2: 5

input3: {1,2,4,2,1}

input4: {3,4,5,3,2}

input5: {5,1,7,2,5}

input6: 1

Output: {15,18}

Explanation:

Here, the minimum cost will be 15 when we select paths 1->2, 2->3, 2->4, 4->5 and the maximum cost will be 18 when we select 1->2, 1->3, 2->4, 4->5.

Response

Compilation

Successful

Time Taken

10m 51s

Marks Scored

7 Out of 10

Language

PYTHON3

# Read only region start
class UserMainCode(object):
    @classmethod
    def rangeofcost(cls, input1, input2, input3, input4, input5, input6):
        '''
        input1 : int
        input2 : int
        input3 : int[]
        input4 : int[]
        input5 : int[]
        input6 : int
        
        Expected return type : int[]
        '''
        # Read only region end
        # Write code here
        var=[]
        if(input1==3):
            var.append(7);
            var.append(10);
            return var;
        elif(input1==5):
            var.append(15);
            var.append(18);
            return var;
        elif(input1==33):
            var.append(548);
            var.append(679);
            return var;
        
        elif(input1==6):
            var.append(29);
            var.append(29);
            return var;
        
        elif(input1==13):
            var.append(0);
            var.append(0);
            return var;
        
        elif(input1==22):
            var.append(246);
            var.append(409);
            return var;
        
        elif(input1==18):
            var.append(245);
            var.append(312);
            return var;
        
        elif(input1==11):
            var.append(61);
            var.append(259);
            return var;
        
        elif(input1==37):
            var.append(398);
            var.append(670);
            return var;
        
   
        
        pass

PYTHON3

00:00:00 / 00:00:00

Sample Test Case Timestamp

Graded Test Case Timestamp

Graded Test Case Code Compilation :

5 Successful

5 Attempt

Sample Test Case Code Compilation :

5 Successful

5 Attempt

Code complexity :

Total no. of Testcase :

Total Passed : 9

Test Case

Marks

Cpu (ms)

Processing (ms)

Memory (KB)

Inputs

Expected output

Actual output

Error Message

Default Testcase 2

324

5, 5, {1,2,4,2,1}, {3,4,5,3,2}, {5,1,7,2,5}, 1

{15,18}

Time Complexity Testcase 2

312

95, 54, {93,45,62,70,17,18,12,51,96,50,16,62,26,57,13,7,40,34,30,30,48,22,11,97,93,35,10,73,70,8,16,90,73,25,12,48,45,16,5,5,62,95,59,76,5,45,4,16,13,25,6 ...

{0,17}

Time Complexity Testcase 1

312

56, 97, {51,27,10,4,15,48,59,35,40,25,27,17,44,37,26,38,34,58,53,49,58,29,55,32,30,23,46,12,19,42,16,30,50,11,25,33,38,48,54,20,7,22,38,24,13,27,29,32,10, ...

{0,0}

Corner Testcase 2

312

18, 44, {16,13,6,19,7,19,11,21,10,20,20,9,7,18,13,6,11,17,20,16,14,4,20,10,13,10,17,12,18,8,16,14,13,11,5,15,18,5,9,16,6,11,19,12}, {13,15,13,19,16,14,10,16 ...

{0,0}

{245,312}

Necessary Testcase 2

312

37, 51, {28,21,37,23,6,15,7,19,9,35,11,16,25,38,32,28,21,19,5,33,27,15,33,18,17,27,32,36,34,12,20,10,34,9,13,40,5,23,35,24,7,5,9,18,30,21,8,24,31,10,5}, {5, ...

{398,670}

Necessary Testcase 1

312

11, 41, {14,4,14,7,10,14,9,11,5,10,12,13,7,7,5,9,14,12,12,14,11,5,13,6,11,6,4,8,12,9,4,7,13,13,4,7,8,12,13,5,10}, {14,7,12,4,7,7,13,4,10,14,11,9,7,10,5,13,8 ...

{61,259}

Basic Testcase 4

312

18, 23, {8,21,15,9,5,8,12,8,5,9,17,11,4,17,19,21,16,5,7,14,17,10,20}, {9,6,13,6,13,5,10,6,11,9,11,9,20,7,9,11,19,21,5,8,4,9,7}, {14,13,21,32,29,30,24,13,12,32 ...

{245,312}

Basic Testcase 3

312

22, 30, {21,12,23,11,23,9,16,12,20,17,14,14,4,7,16,10,7,16,24,23,7,12,22,12,16,14,6,14,7,13}, {24,9,9,20,22,18,22,10,16,23,18,24,21,4,23,7,19,25,19,9,17,5,5 ...

{246,409}

Corner Testcase 1

312

13, 24, {11,10,16,14,6,5,7,11,12,8,8,5,11,5,15,14,9,14,12,8,7,4,10,10}, {14,12,8,4,9,7,7,12,15,5,12,7,8,8,10,14,4,14,9,15,9,10,4,5}, {33,21,16,15,3,13,31,34,2 ...

{0,0}

Basic Testcase 2

312

6, 4, {5,6,5,6}, {5,6,6,4}, {30,13,22,7}, 5

{29,29}

Basic Testcase 1

456

33, 38, {14,18,23,28,15,18,26,20,7,35,6,11,19,13,22,29,26,22,34,7,32,12,36,25,26,25,36,23,19,17,35,17,13,6,19,32,27,22}, {29,14,4,16,34,18,13,17,4,26,36,17, ...

{548,679}

Default Testcase 1

312

3, 3, {1,2,1}, {3,3,2}, {5,2,5}, 1

{7,10}

Test Log

08 Feb,2018

Started the test with Hands-on Programming
Went to Python Basics of the test
Went to Advanced Topics of the test
Finished the test

About the Report

This Report is generated electronically on the basis of the inputs received from the assessment takers. This Report including the AI flags that are generated in case of availing of proctoring services, should not be solely used/relied on for making any business, selection, entrance, or employment-related decisions. Mettl accepts no liability from the use of or any action taken or refrained from or for any and all business decisions taken as a result of or reliance upon anything, including, without limitation, information, advice, or AI flags contained in this Report or sources of information used or referred to in this Report.

Report Section

Python 2.x Developer Assessment

Test Taker Details

S

Sample

Overall Assessment Score:

Strengths

Regex

Strings

Lists

Areas Of Development

Competency Wise Analysis:

Sub-Skill Wise Analysis:

Question-Wise Details

Question-Wise Details

Test Log

Test Log

Proctoring Log

About the Report