Professional Documents
Culture Documents
Overall Status: Completed Detailed Status: Test-taker Completed Test Finish Time: October 19, 2023 12:17:28 AM IST
Chris
C Email Address: chrisdsouza07@yahoo.in
Test-Taker ID: - 124718009
Country: India
Unsatisfactory(0 - 30) Average(30 - 50) Good(50 - 80) Exceptional(80 - 100) Benchmark/Group Average
Strengths
OOPS Concepts
Strings
1. Functions 2. Arrays
PHP Basics 43
Advanced Topics 50
Hands-on Programming 90
Arrays 17
Functions 0
Control Structures 67
Strings 100
Note: Some sections/questions are hidden by your Administrator. This may change the questions/sections ordering.
Q.
Question 1 Compilation: Successful Time taken: 18m 30s
1
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:
Output Specification:
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
/////
10
Stocks
You want to buy a particular stock at its lowest price and sell it later at its highest price. Since the stock market is unpredictable, you steal the price plans of a
company for this stock for the next N days.
Find the best price you can get to buy this stock to achieve maximum profit.
Input Specification:
Output Specification:
Your function must return the best price to buy the stock at.
Example 1:
input1: 5
input2: {-39957,-17136,35466,21820,-26711}
Output: -57093
Explanation:
The best time to buy the stock will be on Day 2 when the price of the stock will be -57093.
Example 2:
input1: 9
input2: {-4527,-1579,-38732,-43669,-9287,-48068,-30293,-30867,18677}
Output: -207022
Explanation:
The best time to buy the stock will be on Day 8 when the price of the stock will be -207022.
1 <?php PHP
10
11:57 PM : Candidate Looking Away from Screen 11:58 PM : Candidate Face Partially Visible
11:59 PM : Candidate Face Partially Visible 12:00 AM : Candidate Face Partially Visible
12:05 AM : Candidate Looking Away from Screen 12:05 AM : Candidate Face Partially Visible
12:05 AM : Candidate Face Partially Visible 12:06 AM : Candidate Face Partially Visible
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.