2+2=5

number series 0, 0, 2, 1, 4, 2, 6, 3, 8, 4, 10, 5, 12, 6, 14, 7, 16, 8

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()

----> 1 import cv2 2 import os 3 import matplotlib.pyplot as plt 4 import numpy as np 5 import tensorflow as tf modulenotfounderror: no module named 'cv2'

def batting(balls,runs): points=runs/2; if runs>50: points=points+5; if runs>=100: points=points+10; strikerate=runs/balls; if strikerate>=80 and strikerate<=100: points=points+2; elif strikerate>100: points=points+4; print(points)

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

def is_sorted(stuff): for i in stuff: if stuff[i+1] > stuff[i]: return True else: return False numbers = [1, 0, 5, 2, 8] print is_sorted(numbers)

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 }