#2d_array - Twitter Etiketi

1 yıldan fazla bir süre önce

#Day271 of #300DaysOfDSA Topics and Learnings: #2D_Array Problems Revised: 95. #LeetCode #118 : Pascal's Triangle Approach: pascal[i][j] = pascal[i - 1][j] + pascal[i - 1][j - 1] Complexity Analysis: TC: O(N ^ 2) SC: O(N ^ 2)

jsambhav5's tweet photo. #Day271 of #300DaysOfDSA

Topics and Learnings: #2D_Array

Problems Revised:
95. #LeetCode #118 : Pascal's Triangle

Approach:
pascal[i][j] = pascal[i - 1][j] + pascal[i - 1][j - 1]

Complexity Analysis:
TC: O(N ^ 2)
SC: O(N ^ 2) https://t.co/tOpWpELbhh

0

2

0

6

Sambhav Jain @jsambhav5

1 yıldan fazla bir süre önce

#Day138 of #150DaysOfDSA Topics and Learnings: #Arrays, #2D_Array Problems Revised: 21. #Leetcode #54 : Spiral Matrix Approach: Used four separate loops to print the array elements in spiral TC: O(M * N) SC: O(1)

jsambhav5's tweet photo. #Day138 of #150DaysOfDSA

Topics and Learnings: #Arrays, #2D_Array

Problems Revised:
21. #Leetcode #54 : Spiral Matrix
Approach:
Used four separate loops to print the array elements in spiral

TC: O(M * N)
SC: O(1) https://t.co/xraOskUcfe

0

2

0

11

Sambhav Jain @jsambhav5

1 yıldan fazla bir süre önce

#Day136 of #150DaysOfDSA Topics and Learnings: #2D_Array Problems Solved: 148. #LeetCode #118 : Pascal's Triangle Approach: pascal[i][j] = pascal[i - 1][j] + pascal[i - 1][j - 1] TC: O(N ^ 2) SC: O(N ^ 2)

jsambhav5's tweet photo. #Day136 of #150DaysOfDSA

Topics and Learnings: #2D_Array

Problems Solved:
148. #LeetCode #118 : Pascal's Triangle
Approach:
pascal[i][j] = pascal[i - 1][j] + pascal[i - 1][j - 1]

TC: O(N ^ 2)
SC: O(N ^ 2) https://t.co/ml9TgAwdGT

0

2

0

8

Sambhav Jain @jsambhav5

1 yıldan fazla bir süre önce

#Day134 of #150DaysOfDSA Topics and Learnings: #Arrays, #2D_Array Problems Revised: 18. #Leetcode #53 : Maximum Subarray Approach: Using Kadane's Algorith => Don't include Subarrays with negative sum TC: O(N) SC: O(1)

jsambhav5's tweet photo. #Day134 of #150DaysOfDSA

Topics and Learnings: #Arrays, #2D_Array

Problems Revised:
18. #Leetcode #53 : Maximum Subarray
Approach:
Using Kadane's Algorith =>
Don't include Subarrays with negative sum

TC: O(N)
SC: O(1) https://t.co/IDBCbWX5Na

0

2

0

12

Sambhav Jain @jsambhav5

neredeyse 2 yıl önce

#Day32 of #100DaysOfDSA Topics and Learnings: #BinarySearch, #Matrix, #2D_Array Problems Solved: 59. #LeetCode #74 : Search a 2D Matrix Approach: Since Matrix is sorted, used Binary search to search in the matrix TC: O(log(m * n)) SC: O(1)

jsambhav5's tweet photo. #Day32 of #100DaysOfDSA

Topics and Learnings: #BinarySearch, #Matrix, #2D_Array

Problems Solved:
59. #LeetCode #74 : Search a 2D Matrix
Approach:
Since Matrix is sorted, used Binary search to search in the matrix
TC: O(log(m * n))
SC: O(1) https://t.co/jJOrg0QIR3

1

2

0

9

Sambhav Jain @jsambhav5

neredeyse 2 yıl önce

#Day16 of #100DaysOfDSA Topics and Learnings: #2D_Array, #Matrix, #Transpose Problems Solved: 34. #LeetCode #48 : Rotate Image I used the concept that Clockwise rotation of a Matrix is transpose of the matrix, followed by mirror image of the matrix about middle Y-axis