0% found this document useful (0 votes)
268 views4 pages

Hassan Raza Test

This document contains an automated skill rating and challenge solutions for a user named Hassan Raza. The user scored 73% overall with a 73% code challenge score and no plagiarism issues detected. The document provides details of the user's performance on four coding challenges in SQL, C++, and data structures. It also notes the user left the assessment tab three times during the challenges.

Uploaded by

Noah Ryan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
268 views4 pages

Hassan Raza Test

This document contains an automated skill rating and challenge solutions for a user named Hassan Raza. The user scored 73% overall with a 73% code challenge score and no plagiarism issues detected. The document provides details of the user's performance on four coding challenges in SQL, C++, and data structures. It also notes the user left the assessment tab three times during the challenges.

Uploaded by

Noah Ryan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

You can share this report with people via the URL above Save PDF

Hassan Raza Automated skill ratings


hassanraza0140@gmail.com
Joined on 06/07/21 SQL

UET Lahore Test-07 June 2021 Advanced

Final score 73%


C++
Code challenge score 73% Beginner

Multiple choice score N/A


Data Structures
Beginner
Plagiarism issues No issues

Copying Not detected

Reference search No searches

Leaving tab 3 times


Learn more about the skill ratings and chart

Your scorecard Your private notes

Code quality & documentation





Normal

SQL skills



Private notes to share with your team...

C++ skills


Open-ended answers


Recommendation

Learn more about how the scorecard works Save

Challenge solutions Collapse all details

. SQL Sort Ages SQL 10/10

In this MySQL challenge, your query should return the rows from your table where LastName = Smith or FirstName = Robert and the rows should be
sorted by Age in ascending order. Your output should look like the following table.

/* write your SQL query below */

SELECT * FROM maintable_N72ZJ where FirstName = "Robert" or LastName = "Smith" order by Age asc
. SQL Contains Letter SQL 10/10
You can share this report with people via the URL above Save PDF
In this MySQL challenge, your query should return the number of rows from your table where FirstName contains "e" and LastName has more than 5
characters. Your output should look like the following table.

/* write your SQL query below */

SELECT count(*) FROM maintable_732W4 where FirstName Like '%e%' and length(LastName) > 5

. Array Addition C++ 0/10

Have the function ArrayAddition(arr) take the array of numbers stored in arr and return the string true if any combination of numbers in the array
(excluding the largest number) can be added up to equal the largest number in the array, otherwise return the string false. For example: if arr contains
[4, 6, 23, 10, 1, 3] the output should return true because 4 + 6 + 10 + 3 = 23. The array will not be empty, will not contain all the same elements, and may
contain negative numbers.

#include <iostream>#include <string>

using namespace std;

bool ArrayChallenge(int arr[], int arrLength) {

// code goes here

int largest_number = 0;

bool flag = false;

//Find the largest Number

for ( int i = 0 ; i < arrLength ; i++)

if(arr[i] > largest_number)

largest_number = arr[i];

for(int i = 0 ; i< arrLength; i++) {

for(int j = i + 1 ; j <= arrLength-1 ; j++)

int temp;

if(arr[i] > arr[j])

temp = arr[i];

arr[i] = arr[j];

arr[j] = temp;

int sumOfNumber = 0;

for(int i = 0 ; i< arrLength-1 ; i++)

sumOfNumber = 0;

for(int j =i ; j< arrLength-1 ; j++) {

sumOfNumber +=arr[j];

if(sumOfNumber == largest_number)

flag = true;

break;

return flag;

int main(void) {

// keep this function call here

int A[] = coderbyteInternalStdinFunction(stdin);

int arrLength = sizeof(A) / sizeof(*A);

cout << ArrayChallenge(A, arrLength);

return 0;

}
Leaving tab: this user left the page the following times during this challenge
You can share this report with people via the URL above Save PDF
06/07/21, 10:27am
06/07/21, 10:39am
06/07/21, 11:30am

. Arith Geo C++ 9/10

Have the function ArithGeo(arr) take the array of numbers stored in arr and return the string "Arithmetic" if the sequence follows an arithmetic
pattern or return "Geometric" if it follows a geometric pattern. If the sequence doesn't follow either pattern return -1. An arithmetic sequence is one
where the difference between each of the numbers is consistent, where as in a geometric sequence, each term after the first is multiplied by some
constant or common ratio. Arithmetic example: [2, 4, 6, 8] and Geometric example: [2, 6, 18, 54]. Negative numbers may be entered as parameters, 0 will
not be entered, and no array will contain all the same elements.

#include <iostream>#include <string>

using namespace std;

string ArrayChallenge(int arr[], int arrLength) {

int arth=0,geo=0;

bool ar=false,g=false;

arth=arr[1]-arr[0];

geo = arr[1]/arr[0];

for(int i =0; i< arrLength-1; i++)

ar = false;

if(arr[i]+arth == arr[i+1])

ar = true;

for(int i =0 ; i< arrLength-1; i++)

g=false;

if(arr[i] * geo == arr[i+1])

g=true;

if(ar)

return "Arithmetic";

else if(g)

return "Geometric";

else

return "-1";

int main(void) {

// keep this function call here

int A[] = coderbyteInternalStdinFunction(stdin);

int arrLength = sizeof(A) / sizeof(*A);

cout << ArrayChallenge(A, arrLength);

return 0;

Video recordings
SQL Sort Ages
Video 1

SQL Contains Letter


Video 1

Array Addition
Video 1 2

Arith Geo
Video 1

Open-ended answers
1. How many years of experience do you have as a software engineer?
You can share this report with people via the URL above Save PDF
N/A

2. What was the last piece of software you worked on? What did you specifically build?

N/A

Help Guides Blog Privacy Terms Contact What's New

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy