Scribd
Upload
47 views

TECHNICAL ASSESSMENT-batch4

The document provides 20 coding challenges from HackerRank related to problem solving, JavaScript, HTML, databases, and SQL. It includes example problems and links to the full challenges. The candidate is asked to complete the challenges and paste the codes in the sheet. The challenges cover topics like sparse arrays, Fibonacci numbers, happy numbers, bubble sort, SQL queries, and more.

Uploaded by

shraddha soni
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views

TECHNICAL ASSESSMENT-batch4

The document provides 20 coding challenges from HackerRank related to problem solving, JavaScript, HTML, databases, and SQL. It includes example problems and links to the full challenges. The candidate is asked to complete the challenges and paste the codes in the sheet. The challenges cover topics like sparse arrays, Fibonacci numbers, happy numbers, bubble sort, SQL queries, and more.

Uploaded by

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

TECHNICAL ASSESSMENT – FSWD

The next set of questions are based on problem solving. Please run the codes using JavaScript or Java ,
and paste them in this sheet. I have pasted the HAckerRank links for your reference.

1. There is a collection of input strings and a collection of query strings. For each query string,
determine how many times it occurs in the list of input strings. Return an array of the results.
Example
Strings = [‘ab’, ‘ab’, ‘abc’]
Queries = [‘ab’, ‘abc’, ‘bc’]

There are 2 instances of ‘ab’. 1 of ‘abc’ and 0 of ‘bc’. For each query, add an element to the
return array, results = [2,1,0]

https://www.hackerrank.com/challenges/sparse-arrays/problem?isFullScreen=true done

2.

https://www.hackerrank.com/challenges/waiter/problem?isFullScreen=true done

3.

https://www.hackerrank.com/challenges/game-of-two-stacks/problem?isFullScreen=true done

4.

https://www.hackerrank.com/challenges/castle-on-the-grid/problem?isFullScreen=true

5.

https://www.hackerrank.com/challenges/maximum-element/problem?isFullScreen=true

6.

https://www.hackerrank.com/challenges/tree-height-of-a-binary-tree/problem?isFullScreen=true done

7.

Write a JavaScript program to get the first n Fibonacci numbers.The Fibonacci Sequence is the series of
numbers: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, . . . Each subsequent number is the sum of the previous two.

done

8.

Here is a sample html file with a submit button. Now modify the style of the paragraph text through
javascript code.Clicking on the button the font, font size, and color of the paragraph text will be
changed.

done

TimesPro
9.

According to Wikipedia a happy number is defined by the following process :

"Starting with any positive integer, replace the number by the sum of the squares of its digits, and
repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which
does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that
do not end in 1 are unhappy numbers (or sad numbers)".

Write a JavaScript program to find and print the first 5 happy numbers. done

10.

Write a Bubble Sort algorithm in JavaScript.

Note: Bubble sort is a simple sorting algorithm that works by repeatedly stepping through the list to be
sorted,

Sample Data: [6,4,0, 3,-2,1]

Expected Output : [-2, 0, 1, 3, 4, 6]

Database & SQL

11.

https://www.hackerrank.com/challenges/revising-the-select-query/problem?isFullScreen=true done

12.

TimesPro
https://www.hackerrank.com/challenges/weather-observation-station-3/problem?isFullScreen=true
done

13.

https://www.hackerrank.com/challenges/weather-observation-station-8/problem?isFullScreen=true

14.

https://www.hackerrank.com/challenges/name-of-employees/problem?isFullScreen=true done

15.

https://www.hackerrank.com/challenges/occupations/problem?isFullScreen=true done

16.

https://www.hackerrank.com/challenges/the-company/problem?isFullScreen=true done

17.

https://www.hackerrank.com/challenges/revising-aggregations-sum/problem?isFullScreen=true done

18.

https://www.hackerrank.com/challenges/earnings-of-employees/problem?isFullScreen=true done

19.

https://www.hackerrank.com/challenges/symmetric-pairs/problem?isFullScreen=true done

20.

https://www.hackerrank.com/challenges/population-density-difference/problem?isFullScreen=true

****************************** ALL THE BEST *******************************************

TimesPro

You might also like