Side Diagonal

Statement

Given an integer n, create a two-dimensional array of size (n×n) and populate it as follows, with spaces between each character:

• The positions on the minor diagonal (from the upper right to the lower left corner) receive 1 .
• The positions above this diagonal recieve 0 .
• The positions below the diagonal receive 2 .

Print the elements of the resulting array

Solution

 

The diagonal parallel to the main

Statement

Given an integer n$n$, produce a two-dimensional array of size (n×n)and complete it according to the following rules, and print with a single space between characters:

• On the main diagonal write 0 .
• On the diagonals adjacent to the main, write 1 .
• On the next adjacent diagonals write 2 and so forth.

Print the elements of the resulting array.

sample 

n=7

0 1 2 3 4 5 6 1 0 1 2 3 4 5 2 1 0 1 2 3 4 3 2 1 0 1 2 3 4 3 2 1 0 1 2 5 4 3 2 1 0 1 6 5 4 3 2 1 0

Chess Board

Given two numbers n and m. Create a two-dimensional array of size (n×m)and populate it with the characters "." and "*" in a checkerboard pattern. The top left corner should have the character "." 



above figure shows the main chess board pattern, note that "." means white and "*" means black

Unique elements

Given a list of numbers, find and print the elements that appear in the list only once
example 
input: 
4 3 5 2 5 1 3 5
output:
1
2
4

Implementing Linear Regression Algorithm in Python

in this PDF created by me , a short and good introduction into one of the most popular machine learning algorithms it is called Linear regression
in this tutorial we deal with linear regression with single variable
check attached file

Linear Regression.PDF 

Reverse words in a given string

Problem

https://practice.geeksforgeeks.org/problems/reverse-words-in-a-given-string/0

Solution

 

Key Pair
Problem :
 https://practice.geeksforgeeks.org/problems/key-pair/0
Solution

Count pairs with given sum

Problem :

http://practice.geeksforgeeks.org/problems/count-pairs-with-given-sum/0

Solution :

Matrix Transpose

Given a 2D array A, your task is to convert all rows to columns and columns to rows.
Input:
First line contains 2 space separated integers, N - total rows, M - total columns.
Each of the next N lines will contain M space separated integers.
Output:
Print M lines each containing N space separated integers.
Constraints:
$1\le N\le 10$
$1\le M\le 10$
$0\le A\left[i\right]\left[j\right]\le 100$ where $1\le i\le N$ and $1\le j\le M$

$\mathrm{Solution}$

Count frequency of each element in array

Write a program to count the frequency of each element in array , as example if we have 
int a[10]={5, 10, 2, 5, 50, 5, 10, 1, 2, 2};
the output should be 
number     frequency
5          3
10         2
2          3
50         1
1          1