DSA Problem Solutions - Topic & Company Wise

Welcome to the repository that contains a collection of Data Structures and Algorithms (DSA) problems, organized by topic and company. This repository is aimed at helping you practice and improve your problem-solving skills by categorizing the problems according to different topics and companies. You can find the problems sorted as per the topics and the companies that commonly ask these questions.

Please note that this list is continuously being updated, and not all companies or topics are listed here yet. Stay tuned for more updates!

Topics
- Array
- Prefix Sum
- String
- Linked List
- Stack
- Queue
- Binary Tree
- Graph
- Dynamic Programming
- Backtracking
- Greedy
- Map
- Two Pointer and Sliding Window
- Bit Manipulation
Companies
- Amazon
- Google
- Microsoft
- Facebook
- Adobe
- Apple
- Netflix
- LinkedIn
- IBM
- Goldman Sachs
- Oracle
- Samsung
- Uber
- Autodesk
- Visa
- Accolite
- Housing.com
- Flipkart
- Paytm
- Morgan Stanley
- MakeMyTrip

Topics

Array

Leetcode 2381. Shifting Letters II
Leetcode 2270. Number of Ways to Split Array
Leetcode 2559. Count Vowel Strings in Ranges

String

Leetcode 1408. String Matching in an Array
Leetcode 1769. Minimum Number of Operations to Move All Balls to Each Box
Leetcode 1930. Unique Length-3 Palindromic Subsequences
Leetcode 3042. Count Prefix and Suffix Pairs I
Leetcode 916. Word Subsets
Leetcode 2185. Counting Words With a Given Prefix
Leetcode 551. Student Attendance Record I

Map

Geeksforgeeks Count Subarrays with given XOR
Geeksforgeeks Subarrays with sum K

Linked List

Leetcode 21. Merge Two Sorted Lists

Two Pointer

Geeksforgeeks Count all triplets with given sum in sorted array
Count Pairs whose sum is less than target
Count the number of possible triangles
Pair with given sum in a sorted array
Sum Pair closest to target
Geeksforgeeks: Indexes of Subarray Sum
Geeksforgeeks Count distinct elements in every window

Leetcode 397. Integer Replacement
Leetcode 552. Student Attendance Record II

Leetcode 174. Dungeon Game

Graph

Leetcode 787. Cheapest Flights Within K Stops

Companies

Amazon

Leetcode 1930. Unique Length-3 Palindromic Subsequences
Geeksforgeeks: Indexes of Subarray Sum
Geeksforgeeks Count distinct elements in every window

Google

Leetcode 1930. Unique Length-3 Palindromic Subsequences
Leetcode 552. Student Attendance Record II
Geeksforgeeks: Indexes of Subarray Sum

Facebook

Leetcode 1930. Unique Length-3 Palindromic Subsequences
Geeksforgeeks: Indexes of Subarray Sum

Geeksforgeeks Equilibrium Point

Microsoft

Geeksforgeeks Count distinct elements in every window

Adobe

Leetcode 1930. Unique Length-3 Palindromic Subsequences

Geeksforgeeks Equilibrium Point

Apple

Leetcode 1930. Unique Length-3 Palindromic Subsequences

Samsung

Leetcode 3042. Count Prefix and Suffix Pairs I

Uber

Leetcode 1930. Unique Length-3 Palindromic Subsequences
Leetcode 3042. Count Prefix and Suffix Pairs I

Geeksforgeeks Equilibrium Point

Autodesk

Leetcode 3042. Count Prefix and Suffix Pairs I

Visa

Geeksforgeeks: Indexes of Subarray Sum

Accolite

Geeksforgeeks Count distinct elements in every window

Housing.com

Geeksforgeeks and Leetcode 3. Longest substring with distinct characters

IBM

Leetcode 3223. Minimum Length of String After Operations

Flipkart

Note: The list of topics and companies is being continuously updated. If you don't see your desired topic or company here, check back soon for new additions!

Name		Name	Last commit message	Last commit date
Latest commit History 1,012 Commits
Asked In Last 6 months - 12 months (as per 1 Jan 2025)		Asked In Last 6 months - 12 months (as per 1 Jan 2025)
DCP-05-25		DCP-05-25
DCP-06-25		DCP-06-25
DCP-07-25		DCP-07-25
DCP-08-25		DCP-08-25
DCP-09-25		DCP-09-25
DCP-10-25		DCP-10-25
Difficulty: Basic		Difficulty: Basic
Difficulty: Easy		Difficulty: Easy
Difficulty: Hard		Difficulty: Hard
Difficulty: Medium		Difficulty: Medium
Problems		Problems
01-Matrix.cpp		01-Matrix.cpp
3Sum-Closest.cpp		3Sum-Closest.cpp
Article-Views-I.sql		Article-Views-I.sql
Asteroid-Collision.cpp		Asteroid-Collision.cpp
Average-Selling-Price.sql		Average-Selling-Price.sql
Average-Time-of-Process-per-Machine.sql		Average-Time-of-Process-per-Machine.sql
Backspace-String-Compare.cpp		Backspace-String-Compare.cpp
Balanced-Binary-Tree.cpp		Balanced-Binary-Tree.cpp
Best-Time-to-Buy-and-Sell-Stock-II.cpp		Best-Time-to-Buy-and-Sell-Stock-II.cpp
Best-Time-to-Buy-and-Sell-Stock-III.cpp		Best-Time-to-Buy-and-Sell-Stock-III.cpp
Best-Time-to-Buy-and-Sell-Stock-IV.cpp		Best-Time-to-Buy-and-Sell-Stock-IV.cpp
Big-Countries.sql		Big-Countries.sql
Biggest-Single-Number.sql		Biggest-Single-Number.sql
Binary-Search-Tree-to-Greater-Sum-Tree.cpp		Binary-Search-Tree-to-Greater-Sum-Tree.cpp
Binary-Tree-Inorder-Traversal.cpp		Binary-Tree-Inorder-Traversal.cpp
Binary-Tree-Postorder-Traversal.cpp		Binary-Tree-Postorder-Traversal.cpp
Binary-Tree-Preorder-Traversal.cpp		Binary-Tree-Preorder-Traversal.cpp
Cheapest-Flights-Within-K-Stops.cpp		Cheapest-Flights-Within-K-Stops.cpp
Check-Knight-Tour-Configuration.cpp		Check-Knight-Tour-Configuration.cpp
Check-if-Any-Element-Has-Prime-Frequency.cpp		Check-if-Any-Element-Has-Prime-Frequency.cpp
Classes-With-at-Least-5-Students.sql		Classes-With-at-Least-5-Students.sql
Combination-Sum-II.cpp		Combination-Sum-II.cpp
Combination-Sum-III.cpp		Combination-Sum-III.cpp
Combination-Sum.cpp		Combination-Sum.cpp
Combinations.cpp		Combinations.cpp
Confirmation-Rate.sql		Confirmation-Rate.sql
Construct-Binary-Search-Tree-from-Preorder-Traversal.cpp		Construct-Binary-Search-Tree-from-Preorder-Traversal.cpp
Container-With-Most-Water.cpp		Container-With-Most-Water.cpp
Count-Number-of-Homogenous-Substrings.cpp		Count-Number-of-Homogenous-Substrings.cpp
Count-Number-of-Nice-Subarrays.cpp		Count-Number-of-Nice-Subarrays.cpp
Count-Square-Submatrices-with-All-Ones.cpp		Count-Square-Submatrices-with-All-Ones.cpp
Course-Schedule-II.cpp		Course-Schedule-II.cpp
Course-Schedule.cpp		Course-Schedule.cpp
Customer-Who-Visited-but-Did-Not-Make-Any-Transactions.sql		Customer-Who-Visited-but-Did-Not-Make-Any-Transactions.sql
Customers-Who-Bought-All-Products.sql		Customers-Who-Bought-All-Products.sql
Decode-String.cpp		Decode-String.cpp
Delete-Operation-for-Two-Strings.cpp		Delete-Operation-for-Two-Strings.cpp
Delete-the-Middle-Node-of-a-Linked-List.cpp		Delete-the-Middle-Node-of-a-Linked-List.cpp
Distribute-Candies-Among-Children-I.cpp		Distribute-Candies-Among-Children-I.cpp
Divide-an-Array-Into-Subarrays-With-Minimum-Cost-I.cpp		Divide-an-Array-Into-Subarrays-With-Minimum-Cost-I.cpp
Edit-Distance.cpp		Edit-Distance.cpp
Employee-Bonus.sql		Employee-Bonus.sql
Find-Customer-Referee.sql		Find-Customer-Referee.sql
Find-Followers-Count.sql		Find-Followers-Count.sql
Find-Minimum-in-Rotated-Sorted-Array.cpp		Find-Minimum-in-Rotated-Sorted-Array.cpp
Find-the-Duplicate-Number.cpp		Find-the-Duplicate-Number.cpp
Find-the-Index-of-the-First-Occurrence-in-a-String.cpp		Find-the-Index-of-the-First-Occurrence-in-a-String.cpp
Find-the-Minimum-Area-to-Cover-All-Ones-I.cpp		Find-the-Minimum-Area-to-Cover-All-Ones-I.cpp
Flatten-Binary-Tree-to-Linked-List.cpp		Flatten-Binary-Tree-to-Linked-List.cpp
Fruit-Into-Baskets.cpp		Fruit-Into-Baskets.cpp
Gas-Station.cpp		Gas-Station.cpp
Generate-Parentheses.cpp		Generate-Parentheses.cpp
Happy-Number.cpp		Happy-Number.cpp
House-Robber.cpp		House-Robber.cpp
Immediate-Food-Delivery-II.sql		Immediate-Food-Delivery-II.sql
Implement-Stack-using-Queues.cpp		Implement-Stack-using-Queues.cpp
Implement-Trie-(Prefix-Tree).cpp		Implement-Trie-(Prefix-Tree).cpp
Increasing-Triplet-Subsequence.cpp		Increasing-Triplet-Subsequence.cpp
Insert-into-a-Binary-Search-Tree.cpp		Insert-into-a-Binary-Search-Tree.cpp
Invalid-Tweets.sql		Invalid-Tweets.sql
Isomorphic-Strings.cpp		Isomorphic-Strings.cpp
Keys-and-Rooms.cpp		Keys-and-Rooms.cpp
Knight-Dialer.cpp		Knight-Dialer.cpp
Kth-Largest-Element-in-a-Stream.cpp		Kth-Largest-Element-in-a-Stream.cpp
Kth-Smallest-Element-in-a-BST.cpp		Kth-Smallest-Element-in-a-BST.cpp
LRU-Cache.cpp		LRU-Cache.cpp
Largest-Odd-Number-in-String.cpp		Largest-Odd-Number-in-String.cpp
Length-of-Last-Word.cpp		Length-of-Last-Word.cpp
Lexicographically-Smallest-Palindrome.cpp		Lexicographically-Smallest-Palindrome.cpp
Longest-Consecutive-Sequence.cpp		Longest-Consecutive-Sequence.cpp
Longest-Increasing-Subsequence.cpp		Longest-Increasing-Subsequence.cpp
Longest-Repeating-Character-Replacement.cpp		Longest-Repeating-Character-Replacement.cpp
Longest-Valid-Parentheses.cpp		Longest-Valid-Parentheses.cpp
Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cpp		Lowest-Common-Ancestor-of-a-Binary-Search-Tree.cpp
Managers-with-at-Least-5-Direct-Reports.sql		Managers-with-at-Least-5-Direct-Reports.sql
Max-Consecutive-Ones-III.cpp		Max-Consecutive-Ones-III.cpp
Maximal-Rectangle.cpp		Maximal-Rectangle.cpp
Maximal-Square.cpp		Maximal-Square.cpp
Maximum-Length-of-Pair-Chain.cpp		Maximum-Length-of-Pair-Chain.cpp
Maximum-Length-of-Repeated-Subarray.cpp		Maximum-Length-of-Repeated-Subarray.cpp
Maximum-Nesting-Depth-of-the-Parentheses.cpp		Maximum-Nesting-Depth-of-the-Parentheses.cpp
Maximum-Product-Subarray.cpp		Maximum-Product-Subarray.cpp
Maximum-Profit-in-Job-Scheduling.cpp		Maximum-Profit-in-Job-Scheduling.cpp
Maximum-Sum-BST-in-Binary-Tree.cpp		Maximum-Sum-BST-in-Binary-Tree.cpp
Middle-of-the-Linked-List.cpp		Middle-of-the-Linked-List.cpp
Min-Cost-to-Connect-All-Points.cpp		Min-Cost-to-Connect-All-Points.cpp
Min-Stack.cpp		Min-Stack.cpp
Minimize-the-Maximum-Edge-Weight-of-Graph.cpp		Minimize-the-Maximum-Edge-Weight-of-Graph.cpp

Folders and files

Latest commit

History

Repository files navigation

DSA Problem Solutions - Topic & Company Wise

Table of Contents

Topics

Companies

About

Resources

Uh oh!

Stars

Watchers

Forks

Uh oh!

Uh oh!

Languages