jayeshmann/Striver-DSA-Sheet

This Repository is based on Striver DSA Sheet problems solved by me for Interview preparation. All solutions are coded in C++ language.

Striver DSA Sheet

Striver DSA Sheet Link

This Repository is based on Striver DSA Sheet problems solved by me (sometimes with help from different resources :p) for Interview preparation. All solutions are coded in C++ language.

My LinkedIn account -> https://www.linkedin.com/in/sayantan-banerjee-iiitgwalior/

My Leetcode account -> https://leetcode.com/tonystark_3000/

My Codeforces account -> https://codeforces.com/profile/tonystark_3000

My CodeChef account - > https://www.codechef.com/users/tonystark_3000

• Part 0

  • Best Time to Buy and Sell - Atmost One Transaction
  • Best Time to Buy and Sell - Any Number of Transaction
  • Best Time to Buy and Sell - Any Number of Transaction with Transaction Fee
  • Best Time to Buy and Sell - Any Number of Transaction with Cooldown
  • Best Time to Buy and Sell - Atmost 2 Transaction
  • Best Time to Buy and Sell - Atmost K Transaction

• Part 1

  • Set Matrix Zeroes
  • Pascal Traingle
  • Next Permutation
  • Maximum Subarray Sum
  • Sort 0 1 2

• Part 2

  • Rotate Matrix
  • Merge Overlapping Intervals
  • Merge Two Sorted Arrays Inplace
  • Find the Duplicate Number

• Part 3

  • Search in a 2D Matrix
  • Power N times X
  • Majority Element Greater than N By 2
  • Majority Element Greater than N By 3
  • Unique Paths in a Grid with obstacles

• Part 4

  • Two Sum
  • Three Sum
  • Four Sum
  • Longest Consecutive Sequence
  • Largest Subarray with Sum Zero
  • Count Number of subarray with XOR K
  • Longest Substring window without repeat

• Part 5 (Linked List)

  • Reverse a Linked List
  • Middle of a Linked List
  • Merge Two Sorted Linked List
  • Remove Nth node from back of Linked List
  • Add Two Numbers represented as Linked List
  • Delete given Node
  • Remove Duplicates From Sorted List

• Part 6 (Linked List)

  • Intersection of Two Linked List
  • Linked List Cycle
  • Starting point of a Linked List Cycle
  • Palindromic Linked List
  • Rotate List By K Times

• Part 7

  • Trapping Rain Water
  • Max Consecutive Ones
  • Remove Duplicates From Sorted Array

• Part 8

  • Mininum Number Of Coin Change
  • Coin Combination - All permutation
  • Coin Combination - Unique permutation
  • Fractional Knapsack
  • Job Sequencing
  • Maximum Unoverlapped Intervals (N Meetings in 1 Room)
  • Maximum Overlapping Intervals

• Part 9 (Recursion / Backtracking)

  • Subset Sums
  • Distinct Subsets
  • Combination Sum With Unique Values in Array
  • Combination Sum With Non-Unique Values in Array
  • Palindromic Partitioning

• Part 10 (Recursion / Backtracking)

  • Permutation with All Unique Values in Array
  • Permutation with Duplicated Values in Array
  • N Queens
  • Print all paths from top-left position to bottom-right position in a matrix
  • Word Break

• Part 11 (Binary Search)

  • Nth Root Of a Number M upto D decimal Places
  • Matrix Median
  • Median of Two Sorted Array
  • Search in a Sorted Matrix
  • Single Element in a Sorted Array
  • Allocate Minimum Number of Pages

• Part 12 (BITS)

  • Is Number Power Of Two
  • Counting Bits
  • Power Set
  • MSB of a number in O(1)
  • XOR of all numbers from 1 to N in O(1)

• Part 13 (Stack / Queue)

  • Implement Stack Using Queue
  • Implement Queue Using Stack
  • Valid Parantheses
  • Next Greater Element Part 1
  • Next Greater Element Part 2

• Part 14

  • Minimum Stack
  • Nearest Smallest Element
  • Online Stock Span
  • Sliding Window Maximum
  • Rotten Oranges
  • LRU - Least Recently Used
  • LFU - Least Frequently Used

• Part 15 (String)

  • Reverse Words In A String
  • Longest Palindromic Substring
  • Longest Common Prefix
  • String To Integer (ATOI))
  • Roman To Integer
  • Integer To Roman

• Part 16 (String)

  • Valid Anagram
  • Count And Say
  • Compare Version Numbers

• Part 17 (Tree Traversals & Views)

  • Inorder Traversal
  • Preorder Traversal
  • Postorder Traversal
  • Left View
  • Top View
  • Bottom View
  • Vertical Order Traversal
  • Level Order Traversal

• Part 18 (Tree)

  • Height/Depth
  • Longest Diameter
  • Check if the tree is height balanced or not
  • Lowest Common Ancestor (LCA) of Two Nodes
  • Check if two trees are Identical or not

• Part 19 (Tree)

  • Symmetric Tree
  • Maximum Path Sum Of Binary Tree
  • Invert / Mirror Binary Tree
  • Populating next pointer in each node
  • Flatten Binary Tree to Linked List
  • Construct Binary Tree from Preorder and Inorder traversal
  • Construct Binary Tree from Postorder and Inorder traversal

• Part 20 (BST - Binary Search Tree)

  • Search in BST
  • Validate BST
  • LCA in BST
  • Create BST From Preorder Traversal
  • Convert Sorted Array to Height Balanced BST
  • Inorder Predecessor and Successor of a Node in a BST

• Part 21 (BST - Binary Search Tree)

  • Ceil In BST
  • Floor In BST
  • Kth smallest in BST
  • Kth largest in BST
  • BST Iterator
  • 2 sum in a BST
  • Maximum Sum BST in a Binary Tree
  • Serialize and Deserialize Binary Tree

• Part 22

  • Kth largest element in a Data Stream
  • Median from Data Stream
  • Count of Distinct Number of Elements in a Sliding Window
  • Flood Fill

• Part 23 (Graphs)

  • DFS Traversal
  • BFS Traversal
  • Cycle Detection In Undirected Graph
  • Cycle Detection In Directed Graph
  • Topological Sort
  • Bipartite Graph
  • Connected Components in Matrix
  • Clone Graph

• Part 24 (Graphs)

  • Kosaraju Algorithm - Strongly Connected Components
  • Dijkstra Algorithm - Shortest distance from Source haing No Negative Edge Weight
  • Bellman Ford - Shortest distance from Source having Negative Edge Weight but NO Negative Cycle
  • Floyd Warshall - Shortest distance between every pair of nodes
  • Minimum Spanning Tree - Kruskal - DSU
  • Minimum Spanning Tree - Prim

• Part 25 (DP)

  • 0-1 Knapsack
  • LIS - Longest Increasing Subsequence
  • LCS - Longest Common Subsequence
  • Maximum Product Subarray
  • Edit Distance
  • Matrix Chain Multiplication

• Part 26 (DP)

  • Subset Sum
  • Minimum Sum Path
  • Minimum Cuts to have Palindrome Partitioning - MCM Variation