Scribd
Upload
32 views2 pages

Arrays

The document outlines various data structures and algorithms categorized into 12 sections, including Arrays, Strings, Linked Lists, Stacks & Queues, Trees & Binary Trees, Binary Search Trees, Heaps, Hashing, Recursion & Backtracking, Dynamic Programming, Graphs, and Tries. Each section lists key problems or algorithms relevant to that category, such as Two Sum in Arrays and BFS/DFS in Graphs. This serves as a comprehensive guide for understanding and implementing fundamental concepts in computer science.

Uploaded by

Kanika Chhabra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views2 pages

Arrays

The document outlines various data structures and algorithms categorized into 12 sections, including Arrays, Strings, Linked Lists, Stacks & Queues, Trees & Binary Trees, Binary Search Trees, Heaps, Hashing, Recursion & Backtracking, Dynamic Programming, Graphs, and Tries. Each section lists key problems or algorithms relevant to that category, such as Two Sum in Arrays and BFS/DFS in Graphs. This serves as a comprehensive guide for understanding and implementing fundamental concepts in computer science.

Uploaded by

Kanika Chhabra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Arrays

• Two Sum
• Kadane’s Algorithm (Maximum Subarray)
• Merge Intervals
• Majority Element (Boyer-Moore Voting Algorithm)
• Rotate Array

2. Strings

• Longest Palindromic Substring


• Anagram Check
• Longest Common Prefix
• String Compression
• Group Anagrams

3. Linked Lists

• Reverse a Linked List


• Detect Cycle in Linked List
• Merge Two Sorted Lists
• Remove N-th Node from End
• Intersection of Two Linked Lists

4. Stacks & Queues

• Valid Parentheses
• Min Stack
• Implement Queue using Stacks
• Daily Temperatures
• Sliding Window Maximum

5. Trees & Binary Trees

• Inorder / Preorder / Postorder Traversals


• Validate Binary Search Tree
• Lowest Common Ancestor
• Diameter of Binary Tree
• Zigzag Level Order Traversal

6. Binary Search Trees

• Insert/Delete/Search in BST
• Kth Smallest Element in BST
• Convert Sorted Array to BST

7. Heaps

• Top K Frequent Elements


• Kth Largest Element
• Merge K Sorted Lists

8. Hashing

• Two Sum
• Subarray with Zero Sum
• Longest Consecutive Sequence
• Count of Subarrays with Given XOR

9. Recursion & Backtracking

• N-Queens
• Sudoku Solver
• Subsets
• Combination Sum
• Word Search

10. Dynamic Programming

• 0/1 Knapsack
• Longest Increasing Subsequence
• Longest Common Subsequence
• Coin Change
• Edit Distance

11. Graphs

• BFS / DFS
• Detect Cycle (Undirected & Directed)
• Dijkstra’s Algorithm
• Topological Sort
• Minimum Spanning Tree (Kruskal, Prim)

12. Tries

• Implement Trie
• Word Search II
• Longest Word with All Prefixes

You might also like