Skip to content

Pulkit-Pandey-09/MY-DS-ALGO-CODES

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

305 Commits
0643-maximum-average-subarray-i
0643-maximum-average-subarray-i
 
 
1-two-sum
1-two-sum
 
 
100-same-tree
100-same-tree
 
 
102-binary-tree-level-order-traversal
102-binary-tree-level-order-traversal
 
 
103-binary-tree-zigzag-level-order-traversal
103-binary-tree-zigzag-level-order-traversal
 
 
105-construct-binary-tree-from-preorder-and-inorder-traversal
105-construct-binary-tree-from-preorder-and-inorder-traversal
 
 
106-construct-binary-tree-from-inorder-and-postorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal
 
 
110-balanced-binary-tree
110-balanced-binary-tree
 
 
114-flatten-binary-tree-to-linked-list
114-flatten-binary-tree-to-linked-list
 
 
1143-longest-common-subsequence
1143-longest-common-subsequence
 
 
1192-critical-connections-in-a-network
1192-critical-connections-in-a-network
 
 
130-surrounded-regions
130-surrounded-regions
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
1486-xor-operation-in-an-array
1486-xor-operation-in-an-array
 
 
152-maximum-product-subarray
152-maximum-product-subarray
 
 
1598-crawler-log-folder
1598-crawler-log-folder
 
 
1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period
1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period
 
 
1624-largest-substring-between-two-equal-characters
1624-largest-substring-between-two-equal-characters
 
 
1701-average-waiting-time
1701-average-waiting-time
 
 
1814-count-nice-pairs-in-an-array
1814-count-nice-pairs-in-an-array
 
 
199-binary-tree-right-side-view
199-binary-tree-right-side-view
 
 
23-merge-k-sorted-lists
23-merge-k-sorted-lists
 
 
230-kth-smallest-element-in-a-bst
230-kth-smallest-element-in-a-bst
 
 
235-lowest-common-ancestor-of-a-binary-search-tree
235-lowest-common-ancestor-of-a-binary-search-tree
 
 
238-product-of-array-except-self
238-product-of-array-except-self
 
 
242-valid-anagram
242-valid-anagram
 
 
257-binary-tree-paths
257-binary-tree-paths
 
 
297-serialize-and-deserialize-binary-tree
297-serialize-and-deserialize-binary-tree
 
 
3-longest-substring-without-repeating-characters
3-longest-substring-without-repeating-characters
 
 
37-sudoku-solver
37-sudoku-solver
 
 
433-minimum-genetic-mutation
433-minimum-genetic-mutation
 
 
450-delete-node-in-a-bst
450-delete-node-in-a-bst
 
 
486-predict-the-winner
486-predict-the-winner
 
 
49-group-anagrams
49-group-anagrams
 
 
496-next-greater-element-i
496-next-greater-element-i
 
 
503-next-greater-element-ii
503-next-greater-element-ii
 
 
51-n-queens
51-n-queens
 
 
515-find-largest-value-in-each-tree-row
515-find-largest-value-in-each-tree-row
 
 
518-coin-change-2
518-coin-change-2
 
 
52-n-queens-ii
52-n-queens-ii
 
 
542-01-matrix
542-01-matrix
 
 
589-n-ary-tree-preorder-traversal
589-n-ary-tree-preorder-traversal
 
 
611-valid-triangle-number
611-valid-triangle-number
 
 
62-unique-paths
62-unique-paths
 
 
63-unique-paths-ii
63-unique-paths-ii
 
 
662-maximum-width-of-binary-tree
662-maximum-width-of-binary-tree
 
 
697-degree-of-an-array
697-degree-of-an-array
 
 
700-search-in-a-binary-search-tree
700-search-in-a-binary-search-tree
 
 
701-insert-into-a-binary-search-tree
701-insert-into-a-binary-search-tree
 
 
717-1-bit-and-2-bit-characters
717-1-bit-and-2-bit-characters
 
 
79-word-search
79-word-search
 
 
900-rle-iterator
900-rle-iterator
 
 
94-binary-tree-inorder-traversal
94-binary-tree-inorder-traversal
 
 
98-validate-binary-search-tree
98-validate-binary-search-tree
 
 
1799. Maximize Score After N Operations
1799. Maximize Score After N Operations
 
 
Bipartite Graph (using dfs)
Bipartite Graph (using dfs)
 
 
Bottom view of binary tree
Bottom view of binary tree
 
 
CC - TYRES
CC - TYRES
 
 
Count the Reversals
Count the Reversals
 
 
Daily Coding Practice: 2021-07-11 (SDE SKIILS)
Daily Coding Practice: 2021-07-11 (SDE SKIILS)
 
 
Dikstraj's algo from gfg(using sets)
Dikstraj's algo from gfg(using sets)
 
 
First negative integer in every window of size k (Fixed Sliding Window)
First negative integer in every window of size k (Fixed Sliding Window)
 
 
LC - 1. Two Sum
LC - 1. Two Sum
 
 
LC - 12. Integer to Roman
LC - 12. Integer to Roman
 
 
LC - 1254. Number of Closed Islands (dfs)
LC - 1254. Number of Closed Islands (dfs)
 
 
LC - 1309. Decrypt String from Alphabet to Integer Mapping
LC - 1309. Decrypt String from Alphabet to Integer Mapping
 
 
LC - 1446. Consecutive Characters
LC - 1446. Consecutive Characters
 
 
LC - 15. 3Sum
LC - 15. 3Sum
 
 
LC - 1590. Make Sum Divisible by P
LC - 1590. Make Sum Divisible by P
 
 
LC - 16. 3Sum Closest
LC - 16. 3Sum Closest
 
 
LC - 167. Two Sum II - Input array is sorted
LC - 167. Two Sum II - Input array is sorted
 
 
LC - 18. 4Sum
LC - 18. 4Sum
 
 
LC - 191. Number of 1 Bits
LC - 191. Number of 1 Bits
 
 
LC - 205. Isomorphic Strings
LC - 205. Isomorphic Strings
 
 
LC - 207. Course Schedule
LC - 207. Course Schedule
 
 
LC - 210. Course Schedule II
LC - 210. Course Schedule II
 
 
LC - 259. 3Sum Smaller
LC - 259. 3Sum Smaller
 
 
LC - 454. 4Sum II
LC - 454. 4Sum II
 
 
LC - 472. Concatenated Words
LC - 472. Concatenated Words
 
 
LC - 5. Longest Palindromic Substring
LC - 5. Longest Palindromic Substring
 
 
LC - 525. Contiguous Array
LC - 525. Contiguous Array
 
 
LC - 560. Subarray Sum Equals K
LC - 560. Subarray Sum Equals K
 
 
LC - 6. ZigZag Conversion
LC - 6. ZigZag Conversion
 
 
LC - 832. Flipping an Image
LC - 832. Flipping an Image
 
 
LC - 872. Leaf-Similar Trees
LC - 872. Leaf-Similar Trees
 
 
LC - 90. Subsets II
LC - 90. Subsets II
 
 
LC - 974. Subarray Sums Divisible by K
LC - 974. Subarray Sums Divisible by K
 
 
LC - 990. Satisfiability of Equality Equations
LC - 990. Satisfiability of Equality Equations
 
 
LC- 104. Maximum Depth of Binary Tree
LC- 104. Maximum Depth of Binary Tree
 
 
LC- 1730. Shortest Path to Get Food
LC- 1730. Shortest Path to Get Food
 
 
LC-101. Symmetric Tree
LC-101. Symmetric Tree
 
 
LC-1018. Binary Prefix Divisible By 5
LC-1018. Binary Prefix Divisible By 5
 
 
LC-102. Binary Tree Level Order Traversal (RECURSION)
LC-102. Binary Tree Level Order Traversal (RECURSION)
 
 
LC-1026. Maximum Difference Between Node and Ancestor
LC-1026. Maximum Difference Between Node and Ancestor
 
 
LC-103. Binary Tree Zigzag Level Order Traversal
LC-103. Binary Tree Zigzag Level Order Traversal
 
 
LC-1095. Find in Mountain Array (TO_DO)
LC-1095. Find in Mountain Array (TO_DO)
 
 
LC-110. Balanced Binary Tree
LC-110. Balanced Binary Tree
 
 
LC-1120. Maximum Average Subtree
LC-1120. Maximum Average Subtree
 
 
LC-1167 Minimum Cost to Connect Sticks
LC-1167 Minimum Cost to Connect Sticks
 
 
LC-118. Pascal's Triangle
LC-118. Pascal's Triangle
 
 

Repository files navigation

alt text

MY CODES

This repository contains all my data structures and algorithms problems codes.

update - repository not updated.

About

This repository contains all my ds/algo codes.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages