Berikut penjelasan dari Question Answered Upscale Go-Jek

Description :

Hello Everyone 🙌

We're looking for 20 data enthusiasts to join Upscale 2.0, an exclusive 2-days hands-on experience with GOJEK Data Science Team. It's open for students, graduates, or young professionals.

We will learn about Machine Learning, Data Modelling, and Data Science practices in GOJEK directly from our Data Avengers. Yes, we're calling our Data Science team member: Avengers :)

Perks? Yes, we have it, Let's start from a one-night hotel stay, return travel, GOJEK merchandises, e-certificate, and intense interaction with our Data Avengers.

Upscale 2.0 will take place in GOJEK Headquarter, Pasaraya Blok M, Jakarta at 13-14 July 2019, Treat this as your weekend getaway

What do you think? Let's secure your seat by applying at bit.ly/joinupscale02 Will wait for your application before 21 June 2019

event : https://www.kalibrr.com/c/go-jek-indonesia/jobs/104990/upscale-for-indonesia-s-tech-students/assessment

Skills Test

Basic Programming Aptitude

3 / Questions answered - Q3

Some people have been studying the following problem: given two numbers, A and B, how many numbers from A to B, inclusive, are divisible by another number K. For example, if A is 1, B is 10, and K is 3, then there are 3 numbers that satisfy this: 3, 6, and 9. Help them by programming a solution to this problem!

Input:

The first line is the number of test cases T. Each test case has three numbers A, B, K, each on their own line given in that order.

Output:

For each test case, output one line of the form “Case C: X” (without the quotes), where C is the case number (starting from 1), and X is the number of integers between A and B, inclusive, that are divisible by K.

Constraints:

1 ≤ T ≤ 100
1 ≤ A ≤ B < 10000
1 ≤ K < 10000

Sample Input:

2
1
10
3
8
20
4 

Sample Output:

Case 1: 3
Case 2: 4

4/ Questions answered - Q4

inti dari soal Q4 adalah : "menghitung berapa kali kata yang dicari muncul, baik secara vertical,horisontal, ataupun diagonal dalam suatu balok(matrix)"

There is a well-known puzzle called Word Search that involves looking for words in a grid of letters.The words are given in a list and can appear in the grid horizontally, vertically, or diagonally in any direction.In this task, you should implement a solver for word search.You will be given grids and a word to search for, and you have to find how many times that word comes out in the grid.Words that are spelled the same backwards and forwards, also known as palindromes, will not be given, so you don’t need to worry about words that match in the exact same spot in two different directions.

Input:

The first line is the number of test cases T. Each test case will have two numbers N and M, each on their own line given in that order.Following that is N lines of M lowercase letters each representing the grid of letters.Lastly, a word W is given that you must look for.

Output:

For each test case, output one line of the form “Case C: X” (without the quotes), where C is the case number (starting from 1), and X is how many times the word W appeared in the grid.

Constraints:

1 ≤ T ≤ 100
1 ≤ N ≤ 100
1 ≤ M ≤ 100
1 ≤ length(W) ≤ 100

Sample Input:

3
3
4
catt
aata
tatc
cat
5
5
gogog
ooooo
godog
ooooo
gogog
dog
2
8
bananana
kalibrrr
nana

Output :

Case 1: 4
Case 2: 8
Case 3: 4