BackmediumArrays Infosys

Galactic Probe Data Analysis Solution

Problem Statement

Given a sequence of sensor readings from a space probe and a set of constraints, find the maximum sum of a subsequence that does not exceed 50 readings and contains at least 10 readings above the cosmic noise threshold of 200.

Example 1
Input
[250, 300, 280, 110, 220, 230, 240, 250, 260, 270, 280, 290, 300, 310, 320, 330, 340, 350, 360, 370, 380, 390, 400, 410, 420, 430, 440, 450, 460, 470, 480, 490, 500, 510, 520, 530, 540, 550, 560, 570, 580, 590, 600, 610, 620, 630, 640, 650, 660, 670, 680, 690, 700, 710, 720, 730, 740, 750, 760, 770, 780, 790, 800, 810, 820, 830, 840, 850, 860, 870, 880, 890, 900, 910, 920, 930, 940, 950, 960, 970, 980, 990, 1000, 1010, 1020, 1030, 1040, 1050, 1060, 1070, 1080, 1090, 1100, 1110, 1120, 1130, 1140, 1150, 1160, 1170, 1180, 1190, 1200, 1210, 1220, 1230, 1240, 1250, 1260, 1270, 1280, 1290, 1300, 1310, 1320, 1330, 1340, 1350, 1360, 1370, 1380, 1390, 1400, 1410, 1420, 1430, 1440, 1450, 1460, 1470, 1480, 1490, 1500, 1510, 1520, 1530, 1540, 1550, 1560, 1570, 1580, 1590, 1600, 1610, 1620, 1630, 1640, 1650, 1660, 1670, 1680, 1690, 1700, 1710, 1720, 1730, 1740, 1750, 1760, 1770, 1780, 1790, 1800, 1810, 1820, 1830, 1840, 1850, 1860, 1870, 1880, 1890, 1900, 1910, 1920, 1930, 1940, 1950, 1960, 1970, 1980, 1990, 2000]
Output
1240

Explanation: Step-by-step: Given the input sequence, we need to find the maximum sum of a subsequence that does not exceed 50 readings and contains at least 10 readings above the cosmic noise threshold of 200. The solution should handle the case when the subsequence exceeds 50 readings correctly. The correct output should be 940, not 1240, because the subsequence [250, 300, 280, 110] is not valid as it exceeds 50 readings.

Example 2
Input
[250, 280, 300, 160, 160, 220, 230, 240, 250, 260, 270, 280, 290, 300, 310, 320, 330, 340, 350, 360, 370, 380, 390, 400, 410, 420, 430, 440, 450, 460, 470, 480, 490, 500, 510, 520, 530, 540, 550, 560, 570, 580, 590, 600, 610, 620, 630, 640, 650, 660, 670, 680, 690, 700, 710, 720, 730, 740, 750, 760, 770, 780, 790, 800, 810, 820, 830, 840, 850, 860, 870, 880, 890, 900, 910, 920, 930, 940, 950, 960, 970, 980, 990, 1000, 1010, 1020, 1030, 1040, 1050, 1060, 1070, 1080, 1090, 1100, 1110, 1120, 1130, 1140, 1150, 1160, 1170, 1180, 1190, 1200, 1210, 1220, 1230, 1240, 1250, 1260, 1270, 1280, 1290, 1300, 1310, 1320, 1330, 1340, 1350, 1360, 1370, 1380, 1390, 1400]
Output
1550

Explanation: Step-by-step: Given the input sequence, we need to find the maximum sum of a subsequence that does not exceed 50 readings and contains at least 10 readings above the cosmic noise threshold of 200. The solution should handle the case when the subsequence exceeds 50 readings correctly. The correct output should be 1400, not 1550, because the subsequence [250, 280, 300, 160, 160] is not valid as it exceeds 50 readings.

Constraints

  • The length of the input array will not exceed 1000.
  • The values in the input array will be between 0 and 1000.

More Arrays Problems

Move Zeros to EndeasySorted SquareseasyFind Balance IndexeasyPartition Even Oddeasy
View all problems →
Live Compiler
Loading...
Test Cases & Output
🔒 Sign up to run your code

🚀 Practice this problem

Run code, get AI hints & track streak

Sign Up Free