Tip
DSA Mastery in 9 Weeks: Read, Solve, Code!
This repository covers the roadmap for mastering Data Structures and Algorithms in JavaScript, Python, C/C++, and Java.
| TABLE OF CONTENTS | |
|---|---|
| • | DSA Roadmap |
| • | JavaScript DSA |
| • | Python DSA |
| • | C/C++ DSA |
| • | Java DSA |
| • |
Mastering DSA as a beginner is simplified into 5 steps:
- Choose a programming language.
- Understand time and space complexities.
- Learn basic data structures and algorithms.
- Practice a lot.
- Join competitions to get really good.
Embark on your data structures and algorithms journey by mastering a programming language. Just as we learn the alphabet and grammar before writing essays, understanding the basics of a language is essential for programming.
Choose a language, whether it's Java, C, C++, Python, or any other of your preference. Before diving into coding, grasp the foundational elements of the language, including basic syntax, data types, variables, operators, conditional statements, loops, functions, etc. Optionally, explore Object-Oriented Programming (OOP) concepts to strengthen your coding foundation.
Now, let's delve into an interesting and crucial topic. The main goal of using DSA is to solve problems effectively and efficiently. How do you assess if your program is efficient? This is where complexities come in, and there are two types:
- Time Complexity: It measures the time needed to execute the code.
- Space Complexity: It indicates the space required for the code to function successfully.
- Design And Analysis Of Algorithms
- Designing efficient algorithms and analyzing their performance.
- Lecture Notes: Design And Analysis Of Algorithms
In DSA, you'll often encounter the term Auxiliary Space, referring to extra space used in the program beyond the input data structure.
It overlooks system-dependent constants and focuses solely on the number of modular operations performed in the entire program. Three commonly used asymptotic notations describe the time complexity of algorithms:
- Big-O Notation (Ο): Describes the worst-case scenario.
- Omega Notation (Ω): Specifies the best-case scenario.
- Theta Notation (θ): Represents the average complexity of an algorithm.
Basics: Asymptotic analysis
◌ Big-O notation in 5 minutes | YouTube |
◌ Particularly for Big-O notation | runestone.academy |
Advanced: Asymptotic analysis
◌ A beginner's guide to Big O notation | rob-bell.net |
◌ Particularly for Big-O notation | YouTube |
◌ Lecture 2: Asymptotic Notation CSCI 700 | web.archive.org |
Practice: Time and Space Complexity
◌ MCQs: Time and Space Complexity | CodeChef |
◌ Particularly for Big-O notation | YouTube |
◌ Practice Problems | IITK Lecture Practice |
◌ 3.1 - Mathematics Basic
◌ 3.2 - Array
◌ 3.3 - String
◌ 3.4 - Stack
◌ 3.5 - Queue
◌ 3.6 - Searching Algorithm
◌ 3.7 - Sorting Algorithm
◌ 3.8 - Divide and Conquer Algorithm
◌ 3.9 - Linked List
◌ 3.10 - Tree Data Structure
◌ 3.11 - Graph Data Structure
◌ 3.12 - Recursion
◌ 3.13 - Backtracking Algorithm
◌ 3.14 - Dynamic Programming
◌ 3.15 - Greedy Methodology
◌ 3.16 - Mathematics Advanced
- Fundamental for evaluating algorithm effectiveness.
- Essential for problems with mathematical characteristics.
- Crucial for mastering Data Structures and Algorithms.
Resources: Mathematics
The array is a fundamental and crucial data structure, presenting a linear arrangement of elements. It serves as a collection of homogeneous data types, with elements allocated contiguous memory. Thanks to this contiguous allocation, accessing any array element occurs in constant time. Each array element is identified by a corresponding index number.
Additional Array Topics to Explore
- Rotation of Array: Shifting elements in a circular manner, such as right circular shift where the last element becomes the first.
- Rearranging an array: Changing the initial order of elements based on specific conditions or operations.
- Range queries in the array: Performing operations on a range of elements, often referred to as range queries.
- Multidimensional array: Arrays with more than one dimension, commonly encountered in the form of 2-dimensional arrays, known as matrices.
- Kadane’s algorithm
- Dutch national flag algorithm
Resources: Arrays
◌ Data Structure Tutorial: Array |
CodeChef |
◌ Arrays: Lecture Notes |
cs.cmu.edu |
◌ Arrays Data Structure |
geeksforgeeks.org |
Practice Problems: Arrays
◌ Little Elephant and Candies |
CodeChef: LECANDY | Editorial |
◌ Chef and Notebooks |
CodeChefL CNOTE | Editorial |
◌ The Minimum Number Of Moves |
CodeChef: SALARY | Editorial |
◌ Mutated Minions |
CodeChef: CHN15A | Editorial |
◌ Chef and Rainbow Array |
CodeChef: RAINBOWA | Editorial |
◌ Forgotten Language |
CodeChef: FRGTNLNG | Editorial |
◌ Leetcode: Interview Practice |
Leetcode: Practice Arrays | Interview Level |
A string, essentially a type of array, can be seen as an array of characters. However, it possesses distinct features, such as the last character being a null character to signify the string's end. Unique operations, like concatenation merging two strings into one, further set strings apart.
Additional String Concepts to Explore
- Subsequence and Substring: A subsequence is derived from a string by deleting one or more elements, while a substring is a contiguous segment of the string.
- Reverse and Rotation in a String: Reversing involves interchanging character positions, while rotation shifts elements circularly.
- Binary String: Comprising only two types of characters.
- Palindrome: A string with elements equidistant from its center being the same.
- Lexicographic Pattern: A pattern based on ASCII values or in dictionary order.
- Pattern Searching: Advanced topic involving searching for a given pattern within the string.
Resources: Strings
◌ C++ Strings |
tutorialspoint.com |
◌ Java strings |
guru99.com |
◌ Python strings |
docs.python.org |
◌ Python strings |
tutorialspoint.com |
◌ Many string questions |
geeksforgeeks.org |
Practice Problems: Strings
◌ Count Substrings |
CodeChef: CSUB | Editorial |
◌ Lapindromes |
CodeChefL LAPIN | Editorial |
◌ Leetcode: Interview Practice |
Leetcode: Practice Strings | Interview Level |
Transitioning to more complex data structures, let's explore the Stack and Queue.
A Stack is a linear data structure that adheres to a specific order for its operations. This order can be LIFO (Last In First Out) or FILO (First In Last Out).
The complexity of the Stack as a data structure arises from its implementation, utilizing other data structures like Arrays, Linked lists, etc., chosen based on the characteristics and features specific to the Stack data structure.
Resources: Stacks
◌ Stack Data Structure |
geeksforgeeks.org |
◌ Stack Data Structure |
tutorialspoint.com |
◌ Stacks: Lecture Notes |
cs.cmu.edu |
Practice Problems: Stacks
◌ Just Next |
spoj.com: JNEXT |
◌ Transform the Expression |
spoj.com: ONP |
◌ Largest Rectangle in a Histogram |
spoj.com: HISTOGRA |
◌ Compilers and parsers |
CodeChefL COMPILER |
◌ Leetcode: Interview Practice |
Leetcode: Practice Stacks |
Similar to a Stack but with distinct characteristics, the Queue is another linear data structure.
A Queue operates on the principle of First In First Out (FIFO) in its individual operations.
Different types of queues include:
- Circular Queue: The last element is connected to the first element, forming a circular structure.
- Double-ended Queue (Deque): Allows operations from both ends of the queue.
- Priority Queue: Elements are arranged based on priority, with lower-priority elements dequeued after higher-priority ones.
Resources: Queues
◌ Array Implementation of Queue |
geeksforgeeks.org |
◌ Stacks and Queues |
viterbi-web.usc.edu |
◌ Stacks and Queues |
cs.cmu.edu |
Practice Problems: Queues
◌ Mass of Molecule |
spoj.com: MMASS |
◌ Transform the Expression |
spoj.com: ONP |
◌ Maximum Xor Secondary |
codeforces.com: 281/D |
◌ Longest Regular Bracket Sequence |
codeforces.com: contest/5/problem/C |
◌ Alternating Current |
codeforces.com: contest/343/problem/B |
◌ Seinfeld |
spoj.com: ANARC09A |
◌ Leetcode: Interview Practice |
Leetcode: Practice Queues |
Having explored linear data structures, it's time to delve into fundamental and widely used algorithms, starting with searching algorithms. Searching algorithms aim to locate a specific element in an array, string, linked list, or other data structures. Key searching algorithms include:
- Linear Search: Iteratively checks for the element from one end to the other.
- Binary Search: Divides the data structure into two equal parts to locate the element.
- Ternary Search: Divides the array into three parts, determining the segment to search based on partitioning values.
Other notable searching algorithms include:
- Jump Search
- Interpolation Search
- Exponential Search
Resources: Searching
◌ Naive string searching |
geeksforgeeks.org |
◌ Detailed Theoretical analysis |
cmu.edu |
◌ Binary search |
khanacademy.org |
Practice Problems: Searching
◌ Searching Algorithms |
geeksforgeeks.org |
◌ GFG: Binary Search |
geeksforgeeks.org |
◌ Leetcode: Interview Practice |
Leetcode: Practice Binary-Search |
Another crucial algorithm is the sorting algorithm, frequently employed when arranging data based on specific conditions becomes necessary. Sorting algorithms are utilized to rearrange a set of homogeneous data, such as sorting an array in increasing or decreasing order.
These algorithms rearrange the elements of a given array or list according to a comparison operator. The comparison operator determines the new order of elements in the respective data structure.
Widely Used Sorting Algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Merge Sort
Numerous other sorting algorithms exist, each beneficial in different scenarios.
Resources: Sorting
◌ Sorting |
khanacademy.org |
◌ BUBBLE SORT |
visualgo.net |
◌ Merge sort algorithm |
youtube.com |
◌ Quick sort algorithm |
youtube.com |
◌ Counting Sort |
geeksforgeeks.org |
Practice Problems: Sorting
◌ Merge Sort |
CodeChef: MRGSRT |
◌ Turbo Sort |
CodeChef: TSORT |
◌ Merge Sort |
CodeChef: MRGSRT |
◌ Leetcode: Interview Practice |
Leetcode: Practice Sorting |
An intriguing and significant algorithm to learn in your programming journey is the Divide and Conquer algorithm. True to its name, it breaks down a problem into parts, solves each subproblem, and then merges the solutions to address the original problem.
The algorithmic paradigm of Divide and Conquer involves three key steps:
- Divide: Break the given problem into subproblems of the same type.
- Conquer: Recursively solve these subproblems.
- Combine: Appropriately combine the answers.
This technique is prominently featured in two sorting algorithms—Merge Sort and Quick Sort.
Resources: Divide and Conquer
◌ Divide-and-Conquer and Recurrences |
cs.cmu.edu |
◌ Divide and Conquer |
geeksforgeeks.org |
Practice Problems: Divide and Conquer
◌ Merge Sort |
codechef.com: MRGSRT |
◌ Tasty Dishes |
codechef.com: TASTYD |
◌ Restore the Permutation |
codechef.com: RESTPERM |
◌ A Magical Length |
codechef.com: ACM14KP1 |
◌ Largest Rectangle in a Histogram |
spoj.com: HISTOGRA |
◌ Compilers and parsers |
CodeChefL COMPILER |
◌ Leetcode: Interview Practice |
Leetcode: Practice Divide and Conquer |
Similar to the aforementioned data structures, a linked list is a linear data structure. However, unlike an array, a linked list doesn't have contiguous memory allocation. Instead, each node in the linked list is assigned to a random memory space, and the previous node maintains a pointer to this node. Direct memory access to any node is not possible, and the linked list is dynamic, allowing for size adjustments at any time.
Linked List Variations to Explore
- Singly Linked List: Each node points only to its next node.
- Circular Linked List: The last node points back to the head of the linked list.
- Doubly Linked List: Each node holds two pointers—one pointing to the next node and the other to the previous node.
Resources: Linked List
◌ Linked List Data Structure |
geeksforgeeks.org |
Practice Problems: Linked List
◌ Leetcode: Interview Practice |
Leetcode: Practice Linked List |
Having covered the basics of linear data structures, let's delve into non-linear structures, starting with the Tree.
The Tree data structure resembles an inverted tree from nature, featuring a root and leaves. The root is the initial node, and the leaves are at the bottom-most level. Notably, there's only one path between any two nodes in a tree.
Based on the maximum number of children a node can have:
- Binary Tree: Each node can have a maximum of 2 children.
- Ternary Tree: Each node can have a maximum of 3 children.
- N-ary Tree: A node can have at most N children.
Additional classifications based on node configuration include:
- Complete Binary Tree: All levels are filled, except possibly for the last level, which is filled from the left as much as possible.
- Perfect Binary Tree: All levels are filled.
- Binary Search Tree: A special binary tree where smaller nodes are on the left, and higher value nodes are on the right.
- Ternary Search Tree: Similar to a binary search tree, but with nodes having at most 3 children.
Resources: Trees
◌ Tree Data Structure |
geeksforgeeks.org |
◌ Heaps (priority queue) |
viterbi-web.usc.edu |
◌ Heaps |
visualgo.net |
◌ Priority Queues: Lecture Notes |
cs.cmu.edu |
◌ UNION-FIND DISJOINT SETS (UFDS) |
visualgo.net |
◌ DISJOINT-SET DATA STRUCTURES |
topcoder.com |
◌ Disjoint set (Union-Find): Lecture Notes |
harvard.edu |
◌ Segment Trees: MIN SEGMENT TREE |
visualgo.net |
◌ RANGE MINIMUM QUERY AND LOWEST COMMON ANCESTOR |
topcoder.com |
◌ Segment Trees |
iarcs.org.in |
◌ BINARY INDEXED TREES: TopCoder |
topcoder.com |
◌ Binary Index Tree (Fenwick tree) |
visualgo.net |
◌ Binary Index Tree: ICO |
iarcs.org.in |
◌ Trees (traversals) |
berkeley.edu |
◌ Dynamic programming on trees |
iarcs.org.in |
Practice Problems: Trees
Moving on to another crucial non-linear structure, let's explore the Graph. Unlike the Tree, a Graph lacks a specific root or leaf node and allows traversal in any order.
A Graph is a non-linear structure composed of a finite set of vertices (or nodes) and a set of edges connecting pairs of nodes. It proves invaluable in solving various real-life problems. Graphs can take different forms based on edge orientation and node characteristics.
Key concepts to explore:
- Types of Graphs: Varying types based on connectivity or weights of nodes.
- Introduction to BFS and DFS: Algorithms for traversing through a graph.
- Cycles in a Graph: Series of connections leading to a loop.
- Topological Sorting in the Graph
- Minimum Spanning Tree in Graph
Resources: Graphs
◌ Graph Data Structure And Algorithms |
geeksforgeeks.org |
◌ Depth First Search or DFS for a Graph |
geeksforgeeks.org |
◌ GRAPH TRAVERSAL (DFS/BFS) |
visualgo.net |
◌ Dijkstra’s shortest path algorithm |
geeksforgeeks.org |
◌ SINGLE-SOURCE SHORTEST PATHS |
visualgo.net |
◌ Bellman Ford Algorithm |
geeksforgeeks.org |
◌ One Source Shortest Path |
compprog.wordpress.com |
◌ Minimum spanning tree |
cs.princeton.edu |
◌ Articulation points |
iarcs.org.in |
◌ Strongly connected components |
iarcs.org.in |
◌ Topological Sorting |
geeksforgeeks.org |
◌ Euler Paths and Euler Circuits |
jlmartin.ku.edu |
◌ Fast Modulo Multiplication |
codechef.com |
◌ Algos for Calculating nCr % M |
codechef.com |
Practice Problems: Graphs
◌ Two Closest |
codechef.com: PAIRCLST |
◌ Special Shortest Walk |
codechef.com: SPSHORT |
◌ Robot Control |
codeforces.com: 346/D |
◌ Arbitrage |
spoj.com: ARBITRAG |
◌ Cost |
spoj.com: HIGHWAYS |
◌ Police Query |
spoj.com: POLQUERY |
◌ Visiting Friends |
codechef.com: MCO16405 |
◌ Chef and Roads |
codechef.com: CL16BF |
◌ Codechef Password Recovery |
codechef.com: CHEFPASS |
◌ Tanya and Password |
codeforces.com: contest/508/problem/D |
◌ One-Way Reform |
codeforces.com: contest/723/problem/E |
◌ Problem Statement for NetworkSecurity |
topcoder.com |
◌ Leetcode: Interview Practice |
Leetcode: Practice Graphs |
Recursion stands out as a vital algorithm leveraging the concept of code reusability and repeated code usage. Its significance extends to being the foundation for many other algorithms, including:
- Tree Traversals
- Graph Traversals
- Divide and Conquer Algorithms
- Backtracking Algorithms
To explore Recursion thoroughly, refer to the following articles/links:
Resources: Recursion
◌ AN INTRODUCTION TO RECURSION PART ONE |
topcoder.com |
◌ AN INTRODUCTION TO RECURSION PART TWO |
topcoder.com |
◌ Introduction to Recursion |
geeksforgeeks.org |
◌ Backtracking, Memoization & Dynamic Programming! |
loveforprogramming.quora.com |
◌ Recursion Interview Questions & Tips |
interviewing.io |
Practice Problems: Recursion
◌ Connecting Soldiers |
codechef.com: NOKIA |
◌ Fit Squares in Triangle |
codechef.com: TRISQ |
◌ Leetcode: Interview Practice |
Leetcode: Practice Recursion |
Derived from Recursion, the Backtracking algorithm allows for retracing if a recursive solution fails, exploring alternative solutions. It systematically tries out all possible solutions to find the correct one.
Backtracking is an algorithmic technique that incrementally builds a solution, removing failed solutions that don't meet problem constraints.
Key problems to tackle in Backtracking algorithms:
- Knight’s Tour Problem
- Rat in a Maze
- N-Queen Problem
- Subset Sum Problem
- M-Coloring Problem
- Hamiltonian Cycle
- Sudoku
Resources: Backtracking
◌ Backtracking Algorithms |
geeksforgeeks.org |
◌ Recursion and Backtracking |
codeforces.com |
◌ Backtracking:the essential part of dynamic programming |
codeforces.com |
◌ Backtracking, Memoization & Dynamic Programming! |
loveforprogramming.quora.com |
◌ Backtracking Archives |
geeksforgeeks.org |
Practice Problems: Backtracking
◌ Leetcode: Interview Practice |
Leetcode: Practice Backtracking |
Dynamic Programming stands as a crucial algorithm, serving as an optimization over plain recursion. It becomes particularly valuable when a recursive solution involves repeated calls for the same inputs, allowing for optimization.
Those who cannot remember the past are condemned to repeat it.
- Dynamic Programming
Key concepts to explore in Dynamic Programming:
- Tabulation vs Memoization
- Optimal Substructure Property
- Overlapping Subproblems Property
- Bitmasking and Dynamic Programming
- Bitmasking and Dynamic Programming
- Digit DP
Resources: Basic Dynamic Programming
◌ Demystifying Dynamic Programming |
freecodecamp.org |
◌ DP Tutorial and Problem List |
codeforces.com |
◌ DYNAMIC PROGRAMMING: FROM NOVICE TO ADVANCED |
topcoder.com |
◌ Dynamic Programming |
geeksforgeeks.org |
◌ Backtracking, Memoization & Dynamic Programming! |
loveforprogramming.quora.com |
Practice Problems: Basic Dynamic Programming
◌ Alternating subarray prefix |
codechef.com: ALTARAY |
◌ Subtraction Game 2 |
codechef.com: AMSGAME2 |
◌ Striver DP Series |
takeuforward.org |
◌ Leetcode: Interview Practice |
Leetcode: Practice Dynamic Programming |
Resources: Adv Dynamic Programming
◌ Dynamic Programming over Subsets and Paths |
codeforces.org |
Practice Problems: Adv Dynamic Programming
◌ Histogram |
spoj.com: HIST2 |
◌ Lazy Cows |
spoj.com: LAZYCOWS |
◌ Traveling by Stagecoach |
spoj.com: TRSTAGE |
◌ Rent your airplane and make money |
spoj.com: RENT |
◌ Increasing Subsequences |
spoj.com: INCSEQ |
◌ Distinct Increasing Subsequences |
spoj.com: INCDSEQ |
◌ Dynamic Programming Type |
codechef.com: problem list |
◌ Striver DP Series |
takeuforward.org |
◌ Leetcode: Interview Practice |
Leetcode: Practice Dynamic Programming |
As the name implies, the Greedy methodology constructs the solution incrementally, selecting the next piece that provides the most immediate benefit — the locally optimal choice leading to global solutions.
Well-suited for problems where choosing locally optimal options also results in global optimality. For instance, the Fractional Knapsack Problem employs a local optimal strategy of choosing items with the maximum value-to-weight ratio, leading to a globally optimal solution as fractions are allowed.
To delve into the Greedy algorithm, explore these sub-topics:
- Standard Greedy Algorithms
- Greedy Algorithms in Graphs
- Greedy Algorithms in Operating Systems
- Greedy Algorithms in Arrays
- Approximate Greedy Algorithms for NP-complete Problems
Resources: Greedy
◌ Greedy Algorithms |
geeksforgeeks.org |
◌ Greedy Algorithms |
iarcs.org.in |
◌ GREEDY IS GOOD |
topcoder.com |
◌ GREEDY IS GOOD |
jeffe.cs.illinois.edu |
Practice Problems: Greedy
◌ Biased Standings |
spoj.com: BAISED |
◌ Load Balancing |
spoj.com: BALIFE |
◌ Many Chefs |
codechef.com: MANYCHEF |
◌ Leetcode: Interview Practice |
Leetcode: Practice Greedy |
- Fundamental for evaluating algorithm effectiveness.
- Essential for problems with mathematical characteristics.
- Crucial for mastering Data Structures and Algorithms.
Mathematical algorithm can be defined as an algorithm or procedure which is utilized to solve a mathematical problem, or mathematical problem which can be solved using DSA.
Resources: Mathematics
| GFG: Mathematical Algorithms for DSA |
| Codeforces: Mathematical Blogs on DSA |
Practice Problems: Mathematics
| Leetcode: Practice Math |
Having covered the basics of major data structures and algorithms, it's time to put your knowledge into practice.
"Practice makes a man perfect."
For learning DSA, consistent and extensive practice is key. Whether considered a separate step or an integral part of the learning process, dedicating time to solving problems and implementing algorithms is essential for mastery.
Explore and enhance your coding skills on various practicing platforms. Compete, solve challenges, and advance your proficiency on platforms like:
- LeetCode
- Codeforces
- HackerRank
- CodeChef
- TopCoder
- AtCoder
- GeeksforGeeks
- InterviewBit
- Exercism
- Project Euler
Competing on these platforms will help you apply your knowledge, face diverse challenges, and continuously improve your problem-solving skills.
Throughout the roadmap to learn DSA, consider the following tips to enhance your learning experience:
- Master the Fundamentals: Thoroughly understand the fundamentals of your chosen programming language, including basic syntax, data types, operators, variables, functions, conditional statements, loops, and Object-Oriented Programming (OOP).
- Implement Concepts Practically: Implement each small concept actively. Practice coding to reinforce your understanding of basic programming constructs.
- Grasp Complexity Analysis: Learn how to analyze the complexity of algorithms. Solve multiple questions to practice calculating complexities. Utilize quizzes on Algorithm Analysis for additional practice.
- Focus on Logic Building: Strengthen your logical thinking by solving problems from scratch without referring to solutions or editorials. The more problems you solve independently, the more robust your logic-building skills become.
- Overcome Challenges: Accept that challenges and roadblocks are part of the learning journey. If you're stuck on a problem or topic, read hints and approaches, and try to solve it independently. If needed, refer to the logic and code it yourself. If facing repeated challenges, consider revisiting the related concepts.
Remember, learning DSA is a continuous process, and persistence and problem-solving skills play crucial roles in your success.
- Striver: Website Link
- Creator: Raj Vikramaditya (Striver)
- A compilation of essential coding interview questions in Data Structures & Algorithms. Commonly asked in interviews at prominent companies like Google, Amazon, and Facebook.
- Love Babbar: Website Link
- Creator: Love Babbar
- A comprehensive list of 450 coding questions by a former Amazon Software Engineer. These questions help in understanding Data Structures & Algorithms and are frequently asked in interviews at companies like Amazon, Microsoft, and Google.
- Apna College: Google Sheet Link
- Creators: Shradha Didi and Aman Bhaiya
- A valuable resource with around 400 problems categorized by topic, along with information about companies that have posed these problems.
- NeetCode: Website Link
- Curated by a Google engineer
- A collection of 150 LeetCode.com questions covering important topics for interviews at FAANG and other big tech companies.
- Arsh: Google Sheet Link
- Creator: Arsh Goyal
- A DSA plan with coding problems designed to prepare for interviews in 45–60 days. Arsh has a background in Samsung, CodeChef, and ISRO.
- AlgoPrep: Google Sheet Link
- Compiled by Nishant Bhaiya from AlgoPrep
- A broad range of coding problems and solutions related to data structures and algorithms, aimed at assisting software development engineers in interview preparation for top tech firms.
Stay tuned for additional resources and guides tailored for specific programming languages:
Introduction: Learn DSA in JavaScript
Introduction: Learn DSA in C++