Videos
Images
Test Logs
Proctor Comments
Report Section
Android Developer with Kotlin
Sample
| 03 Sep 2021
Test Taker Details
S
Sample
Email Address: sample@mercer.com
Test-Taker ID: - 67203491
Last Name:
Not Filled
Date of birth:
Sep 9, 2021
Contact No:
Not Filled
Gender:
Not Filled
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
Strength
Hands On Programming
Areas of Development
Android Backend
Android UI
Android SDK
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
Note: Some sections/questions are hidden by your Administrator. This may change the questions/sections ordering.
Section 1
Hands On Programming
1
question(s)
24m 54s
Time taken
10/10
Marks Scored
Question
Lost in the Forest
A boy is lost in an infinitely long 1 dimensional jungle. The jungle is such that if the boy is standing at location N, then, after the next step he would be moved to location (N/2) if N is even, and (3N + 1) if N is odd.
However, there is a magic door in the jungle that can take him to any location N he wants to go between location 1 and M (including both), but just once.
Find the location that the boy should go to such that he reaches the maximum number of locations in the forest.
Input Specification:
| input1: The value of M |
Output Specification:
Example 1:
| Return the location where the boy should go first. If there are multiple answers, then return the largest one. |
Example 1:
| input1: 5 |
| Output: 3 |
Explanation:
If he selects 3, then he can go to:
3->10->5->16->8->4->2->1.
Example 2:
| input1: 10 |
| Output: 9 |
Explanation:
If he selects 9, he can go to:
9->28->14->7-> 22 ->11 ->34 ->17 ->52-> 26-> 13-> 40-> 20 ->10 ->5-> 16 ->8-> 4-> 2-> 1
/////
Response
Compilation
Successful
Time Taken
24m
54s
Marks Scored
10
Out of
10
Language
KOTLIN
KOTLIN
00:00:00
/
00:00:00
Sample Test Case Timestamp
Graded Test Case Timestamp
Graded Test Case Code Compilation :
1
Successful
1
Attempt
Sample Test Case Code Compilation :
1
Successful
7
Attempt
Code complexity
:
0
Total no. of Testcase :
10
Total Passed :
10
Test Case
Marks
Cpu (ms)
Processing (ms)
Memory (KB)
Inputs
Expected output
Actual output
Error Message
Basic Testcase 4
1
0
421
104068
28
27
27
NA
Basic Testcase 3
1
0
421
104324
44
27
27
NA
Basic Testcase 2
1
0
426
104324
336
327
327
NA
Basic Testcase 1
1
0
525
104068
4847
3711
3711
NA
Necessary Testcase 2
1
0
425
104068
11448
10971
10971
NA
Necessary Testcase 1
1
0
429
104324
27769
26623
26623
NA
Corner Testcase 2
1
0
449
104068
1
1
1
NA
Corner Testcase 1
1
0
538
104324
97
97
97
NA
Time Complexity Testcase 1
1
0
415
104068
28631
26623
26623
NA
Time Complexity Testcase 2
1
0
453
104068
16928
13255
13255
NA
Test Log
Test Log
3rd Sep 2021
-
01:10 PM
-
01:35 PM
-
01:38 PM
-
01:40 PM
-
01:43 PM
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.