Online PHP editor | output for 0okDT

<?php //lets call your $BulkArray = $values; $values=array( 1 => 100, 2 => 300, 3 => 100, 4 => 50, 5 => 50, 6 => 50, 7 => 50, 8 => 50, 9 => 500, 10 => 200, 11 => 100 ); $sum=0; // to sum up until 500 $Vals500=array(); // array to store index with <= 500 $i=0; // index for new aaray that will store keys that made up <= 500 $key1=1; //value to iterate the array defined above //print_r($values); echo '<br/>'; for($key=1; $key <= count($values); $key++){ $sum = $sum + $values[$key]; // get sum of values if($sum <= 500){ $Vals500[$i][]=$key; } //append all key of sum ==500 if($sum == 500) { $i++; $key=$key1++; $sum=0; } //check sum then reinitialize values } foreach($Vals500 as $val){} //search for second array with many indeces in $Vals500. NB: i fail this place echo print_r($Vals500); print 'the highest succession found is '; print_r($Vals500[2]); // ?>