sapanz / hackerrank-problem-solving-python-solutions

Hackerrank Problem solving solutions in Python

Hackerrank-Problem-Solving-Python-Solutions

This repo consists the solution of hackerrank problem solving solutions in python

hackerrank-problem-solving-python-solutions's Issues

run tim error

Divisible sum pairs

your code will give IndexError

because when it reaches i == len(ar)-1 it tries to get ar[j] where j == i + 1 == len(ar)

node webpack issue

(node:18356) [DEP_WEBPACK_DEV_SERVER_ON_AFTER_SETUP_MIDDLEWARE] DeprecationWarning: 'onAfterSetupMiddleware' option is deprecated. Please use the 'setupMiddlewares' option.
(Use node --trace-deprecation ... to show where the warning was created)
(node:18356) [DEP_WEBPACK_DEV_SERVER_ON_BEFORE_SETUP_MIDDLEWARE] DeprecationWarning: 'onBeforeSetupMiddleware' option is deprecated. Please use the 'setupMiddlewares' option.

Print a pattern of numbers

I want to solve the following problem , please assign me
Hackerrank problem
Print a pattern of numbers from to as shown below. Each of the numbers is separated by a single space.

                        4 4 4 4 4 4 4  
                        4 3 3 3 3 3 4   
                        4 3 2 2 2 3 4   
                        4 3 2 1 2 3 4   
                        4 3 2 2 2 3 4   
                        4 3 3 3 3 3 4   
                        4 4 4 4 4 4 4   

Input Format:
The input will contain a single integer .

Sample Input 0:
2

Sample Output 0:
2 2 2
2 1 2
2 2 2