0% found this document useful (0 votes)
59 views

Head Subcategory Item

This document provides an overview of algorithms and data structures topics including searching, sorting, recursion, graphs, trees, hashing, and more. It lists common algorithms like linear search, binary search, and sorting methods like quicksort and merge sort. It also outlines popular data structures such as linked lists, stacks, queues, trees, graphs and how to calculate time and memory complexity. The document provides references to online resources for learning more about each topic and practicing problems.

Uploaded by

Swappy Boi
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
59 views

Head Subcategory Item

This document provides an overview of algorithms and data structures topics including searching, sorting, recursion, graphs, trees, hashing, and more. It lists common algorithms like linear search, binary search, and sorting methods like quicksort and merge sort. It also outlines popular data structures such as linked lists, stacks, queues, trees, graphs and how to calculate time and memory complexity. The document provides references to online resources for learning more about each topic and practicing problems.

Uploaded by

Swappy Boi
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Head Subcategory Item

Algorithms Searching Linear Search


Binary Search
Recursion
Backtracking
Greedy
BFS
DFS

Sorting Quick Sort


Merge Sort
Heap Sort
Counting Sort

Misc. Dynamic Programming


Permutation & combination

Data Structures Linked List


Doubly Linked List
Skip List
Stack
Queue
Priority Queue
Binary Tree
Binary search tree
Binary Index Tree (Fenwick Tree)
Graph
Matrix
Heap
Trie
Hashing
Treap
n-ary Tree
Segment Tree

Time complexity How to calculate


Memory complexity How to calculate

General Topics Interactive Problems


Reference Source
https://www.geeksforgeeks.org/linear-se
https://www.geeksforgeeks.org/binary-se
https://www.geeksforgeeks.org/recurs
https://www.geeksforgeeks.org/backtracking-a
https://www.geeksforgeeks.org/greedy-algo
https://www.hackerearth.com/practice/algorithms/graphs/br
https://www.hackerearth.com/practice/algorithms/graphs/d

https://www.geeksforgeeks.org/quick-s
https://www.geeksforgeeks.org/merge-
https://www.geeksforgeeks.org/heap-s
https://www.geeksforgeeks.org/counting

https://www.geeksforgeeks.org/data-structures
https://www.geeksforgeeks.org/doubly-link
https://www.geeksforgeeks.org/skip-list/ ; https://www.geeksforgeeks.org/skip-list-set-2-insertion/ ;
https://www.geeksforgeeks.org/stack-data-s
https://www.geeksforgeeks.org/queue-data-
https://www.hackerearth.com/practice/notes/heaps-a
https://www.geeksforgeeks.org/binary-tree-dat
https://www.geeksforgeeks.org/binary-search-tree
https://www.geeksforgeeks.org/binary-indexed-tree-
https://www.geeksforgeeks.org/graph-data-structure
https://www.geeksforgeeks.org/array-data-structure/m
https://www.geeksforgeeks.org/heap-data-s
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/trie-keyword-tree/
https://www.geeksforgeeks.org/hashing-data
https://cp-algorithms.com/data_structures/treap.html ; https://www.geeksforgee
https://en.wikipedia.org/wiki/M-ary_tree ; https://www.geeksforgeeks.org/depth-n-ary-tree/ ; h
https://www.hackerearth.com/practice/data-structures/advanced-data

http://bigocheatsheet.com/ ; https://www.geeksforgeeks.org/analysis-of-algorithms-set-1-asymptotic-analysis/ [You c


https://www.geeksforgeeks.org/g-fact-

https://www.geeksforgeeks.org/interactive-problems-in-com
Practice Problems
https://www.hackerearth.com/practice/algorithms/searching/linear-sea
https://www.hackerearth.com/practice/algorithms/searching/binary-sea
https://www.geeksforgeeks.org/recursion-practice-problems
https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and
https://www.techgig.com/practice/algorithms/greedy-alg
https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-se
https://www.hackerearth.com/practice/algorithms/graphs/depth-first-sea

https://www.hackerearth.com/practice/algorithms/sorting/quick-sor
https://www.hackerearth.com/practice/algorithms/sorting/merge-sor
https://www.hackerearth.com/practice/algorithms/sorting/heap-sort
https://www.hackerearth.com/practice/algorithms/sorting/counting-so

https://leetcode.com/tag/dynamic-programming/;https://www.hackerearth.com/practice/algorithms/dynamic-progra

https://www.hackerearth.com/practice/data-structures/linked-list/singly-linked-list/practice-pr
https://www.techgig.com/practice/data-structure/doubly-l

https://www.hackerearth.com/practice/data-structures/stacks/basics-of-st
https://www.hackerearth.com/practice/data-structures/queues/basics-of-q
https://www.hackerearth.com/practice/data-structures/trees/heapspriority-
https://practice.geeksforgeeks.org/explore/?category%5B%5D=Tree&pa
https://www.hackerearth.com/practice/data-structures/trees/binary-search
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick
https://www.hackerearth.com/practice/algorithms/graphs/graph-represent
https://medium.com/@codingfreak/matrix-practice-problems-and-interview
https://www.hackerrank.com/domains/data-structures/heap/diffic
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/tri
https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-h
https://www.codechef.com/tags/problems/treap
https://www.hackerearth.com/practice/data-structures/trees/binary-and-nar
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/s

-
-

You might also like