VIRTUSA CODING ANSWER

1) PIZZA PARTY

2) BOUNTY

3) FIND COMMAS

4) FIND X
5) NEAREST CORNER

6) FROG IN THE POND

7) CHESS GAME

8) ANT ON RAIL
9) MAX SUBARRAY CODE

10) INDEX SORT

11) STRING SWAP

12) MIN DISTANCE OF ASCII CHAR

13) OLIVIA’S GARDEN

14) ROBO RACE

15) ARUDINO
16) SOLVE EQUATION

17) FLIP DIVISION GAME

18) JUMP AND JUMP

19) MARBLES

20)
Magic string

Birthday party

Act on rail
Min array sum
class UserMainCode:

@classmethod

def minimumSum(cls, input1, input2):

def array_sum(arr):

return sum(arr)

initial_sum = array_sum(input2)

sorted_arr = sorted(input2)

avg = (sorted_arr[-1] + sorted_arr[-2]) / 2

updated_arr = [0 if num < avg else num for num in input2]

updated_sum = array_sum(updated_arr)

return min(initial_sum, updated_sum)

Special Fibinocci

Diwali contest
Pyramids(written in c++)

Prefix-suffix

Advanced subarray
class UserMainCode(object):

@classmethod

def getMaximumScore(cls, input1, input2, input3):

max_score = float('-inf')

for i in range(input1 - input2 + 1):

subarray = input3[i:i+input2]

score = sum([(i + 1) * val for i, val in enumerate(subarray)])

max_score = max(max_score, score)

return max_score
surprise pair debate

Maximun pair product

Parallel universe chess

Olive’s garden(java)

Boring arrays(java)

Reduce till zero(java)

RoboRace
class UserMainCode:

@classmethod

def roboRace(cls, input1, input2, input3, input4):

def lcm(a, b):

gcd = 1

for i in range(2, min(a, b) + 1):

if a % i == 0 and b % i == 0:

gcd = i

return (a * b) // gcd

least_common_multiple = lcm(input2, input4)

rtt= [input1 + input2 * i for i in range(least_common_multiple // input2)]

rct= [input3 + input4 * i for i in range(least_common_multiple // input4)]

ct = set(rtt) & set(rct)

return min(ct)

Tiling cost(c++)
Maximun pair product

Best Grade(java)
Nearest corner