KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #ai-agents #developer-tools #typescript #codex #cli #claude-code #mcp #rust #deepseek-harness #ai-agent

Algorithms-cheat-sheet-for-interview

★ 3 Open GitHub ↗

Important Algorithms for coding interviews :books:

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Algorithms cheat sheet
Important algorithms for coding interviews [Java]

**1. Sorting**
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-insertionsort-java">Insertion Sort TC = O(n^2) | SC = O(1)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-mergesort-java">Merge Sort TC = O(nlogn) | SC = O(n)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-quicksort-java">Quick Sort TC = (Best Case = O(nlogn)), (Worst Case = O(n^2)) | SC = (Best Case = O(logn)), (Worst Case = O(n))</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-heapsort-java">Heap Sort TC = O(nlogn) | SC = O(1)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-bubblesort-java">Bubble Sort TC = O(n^2) | SC = O(1)</a>

**2. Heaps**
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-buildingmaxheap-java">Building Max Heap TC = O(n) | SC = O(logn)</a>

**3. Searching**
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-linearsearch-java">Linear Search TC = O(n) | SC = O(1)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-binarysearch-java">Binary Search TC = O(logn) | SC = O(1)</a>

**4. Greedy Algorithms**
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-fractionalknapsack-java">Fractional Knapsack TC = O(nlogn) | SC = O(n)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-huffmanencoding-java">Huffman Encoding TC = O(nlogn) | SC = O(n)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-jobsequencing-java">Job Sequencing TC = O(n^2) | SC = O(n)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-primsmst-java">Prims Algorithm[Adjacency Matrix] TC = O(v^2) | SC = O(v)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-dijsktraalgorithm-java">Dijsktra Algorithm[Adjacency Matrix] TC = O(v^2) | SC = O(v)</a>

**5. Dynamic Programming**
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-matrixchainmultiplication-java">Matrix Chain Multiplication [BU] TC = O(n^3) | SC = O(n^2)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-matrixchainmultiplicationtd-java">Matrix Chain Multiplication [TD] TC = O(n^3) | SC = O(n^2)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-longestcommonsubsequence-java">Longest Common Subsequence TC = O(mn) | SC = O(mn)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-multistagegraph-java">Multistage Graph TC = O(E) | SC = O(V)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-knapsack-java">0-1 Knapsack TC = O(nw) | SC = O(nw)</a>
* <a target="_blank" href="https://gist.github.com/raviranjan3570/8846614513ff40b6e9bbe74b06cfc5c9#file-subsetsum-java">Subset Sum TC = O(nw) | SC = O(nw)</a>

Algorithms-cheat-sheet-for-interview

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README