9 9 -|- | /|/| 3 |2

9 9 -|- | /|/| 3 |2

print matrix diagonally 1 2 3 4 5 6 7 8 9 output 1 2 4 7 5 3 6 8 9. coding ninjas

Write a program that outputs all possibilities to put + or - or nothing between the numbers 1, 2, …, 9 (in this order) such that the result is always 100. For example 1 + 2 + 3 - 4 + 5 + 6 + 78 + 9 = 100

test the program using the following procedure: stack of size n=6 1. call push(5) 2. call push(2) 3. call push(3) 4. call pop() 5. call push(6) 6. call push(9) 7. call push(3) 8. call display() 9. call top()

Given an array, choose two contiguous non-overlapping arrays, such that all elements are strictly increasing. Return the maximum length possible for this combination. Ex: 7 1 2 4 6 5 3 8 9 10 => ans: 7 (Choose 1 2 4 6 & 8 9 10) l

print pattern 1 2 3 4 5 6 11 12 13 14 15 21 22 23 24 25 16 17 18 19 20 6 7 8 9 10 in java

stack operations, if executed on an initially empty stack? push(5), push(3), pop(), push(2), push(8), pop(), pop(), push(9), push(1), pop(), push(7), push(6), pop(), pop(), push(4), pop(), pop().

function find_max(nums) { 2 let max_num = Number.NEGATIVE_INFINITY; // smaller than all other numbers 3 for (let num of nums) { 4 if (num > max_num) { 5 // (Fill in the missing line here) 6 } 7 } 8 return max_num; 9 }