Commit 4403b83

authored

Merge pull request fnplus#603 from prachijustin/my-new-feature

Matrix Rotation, kthSmallEle, StrRev

2 parents 5250b05 + 943cab0 commit 4403b83Copy full SHA for 4403b83

File tree

+79

-0

lines changed

+79

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+''' Rotation of a Square matrix at 90 degree clockwise.`
	`2`	`+ With the least complexity`
	`3`	`+ '''`
	`4`	`+l=[[1,2,3,4],`
	`5`	`+ [5,6,7,8],`
	`6`	`+ [9,10,11,12],`
	`7`	`+ [13,14,15,16]]`
	`8`	`+`
	`9`	`+N = 4`
	`10`	`+x=N-1`
	`11`	`+y=x`
	`12`	`+`
	`13`	`+#for square matrix`
	`14`	`+for i in range(0, x):`
	`15`	`+ for j in range(i,x):`
	`16`	`+ l[j][x], l[i][j] = l[i][j], l[j][x]`
	`17`	`+ l[x][y], l[i][j] = l[i][j], l[x][y]`
	`18`	`+ l[y][i], l[i][j] = l[i][j], l[y][i]`
	`19`	`+ y -= 1`
	`20`	`+ x -= 1`
	`21`	`+ y=x`
	`22`	`+`
	`23`	`+`
	`24`	`+`
	`25`	`+for i in l:`
	`26`	`+ print(i)`

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+#Python program to find the kth smallest element from a list`
	`2`	`+#Without doing sorting`
	`3`	`+`
	`4`	`+`
	`5`	`+''' Eg: list is 61, 32, 80, 59, 20`
	`6`	`+ When sorted: 20, 32, 59, 61, 80`
	`7`	`+ 3rd smallest element is: 59'''`
	`8`	`+`
	`9`	`+N = int(input('Enter size of list: '))`
	`10`	`+`
	`11`	`+print('Enter elements in list: ')`
	`12`	`+l = [int(x) for x in input().split()]`
	`13`	`+`
	`14`	`+K = int(input('kth element to search: '))`
	`15`	`+x = max(l)+1`
	`16`	`+ch = [0] *x`
	`17`	`+`
	`18`	`+for j in range(0, N):`
	`19`	`+ ch[l[j]] += 1`
	`20`	`+for j in range(0, len(ch)):`
	`21`	`+ if ch[j] >= 1:`
	`22`	`+ K -= 1`
	`23`	`+ if K == 0:`
	`24`	`+ print('Element is: ', j)`
	`25`	`+ break`

Lines changed: 28 additions & 0 deletions

Comments

(0)