SDE - 2

You have been given an array/list ‘ARR‘ of length ‘N’ consisting of non-negative integers ARR1, ARR2, ..., ARRN. The i’th integer denotes a point with coordinates (i, ARR[i]). ‘N’ vertical lines are drawn such that the two endpoints of the i’th line are at (i, arr[i]) and (i,0).

Your task is to find two lines, which, together with the x-axis, form a container, such that the container contains the most water. Return the maximum area of the container.

Note:

1. Consider the container to be 2-dimensional for simplicity. 
2. For any pair of sides ignore all the lines that lie inside that pair of sides. 
3. You are not allowed to slant the container.

Example:

Consider 'ARR'= {1,8,6,2,5,4,8,3,7} then the vertical lines are represented by the above image. The blue section denotes the maximum water than a container can contain.

You are given a (9X9) square integer matrix, that contains values between 0-9.This matrix represents a sudoku. Check if sudoku is valid or not.

- The sudoku can be completely filled or partially filled.
- An entry 0 indicates that the corresponding cell is empty.
- Your task is to find out whether this sudoku is valid or not.
- Standard sudoku rules are to be enforced to check whether a sudoku is valid/invalid.
    1. No value should be repeating in a given row.
    2. No value should be repeating in a given column.
    3. No value should be repeating in each of the 9 (3X3) square grids.
- Return a boolean response.

Design BookMyShow app.

Design Cricbuzz type app.