Complete Interview Preparation

View Details

Skip to content

- Tutorials
- Practice DS & Algo.
- Algorithms
- Analysis of Algorithms
- Asymptotic Analysis
- Worst, Average and Best Cases
- Asymptotic Notations
- Little o and little omega notations
- Lower and Upper Bound Theory
- Analysis of Loops
- Solving Recurrences
- Amortized Analysis
- What does 'Space Complexity' mean ?
- Pseudo-polynomial Algorithms
- Polynomial Time Approximation Scheme
- A Time Complexity Question

- Searching Algorithms
- Sorting Algorithms
- Graph Algorithms
- Pattern Searching
- Geometric Algorithms
- Mathematical
- Bitwise Algorithms
- Randomized Algorithms
- Greedy Algorithms
- Dynamic Programming
- Divide and Conquer
- Backtracking
- Branch and Bound
- All Algorithms

- Analysis of Algorithms
- Data Structures
- Interview Corner
- Languages
- CS Subjects
- GATE
- Web Technologies
- Software Designs
- School Learning
- School Programming
- Mathematics
- Maths Notes (Class 8-12)
- NCERT Solutions
- RD Sharma Solutions
- Physics Notes (Class 8-11)

- ISRO CS
- UGC NET CS

- Student
- Jobs
- Courses

- Dijkstra's shortest path algorithm | Greedy Algo-7
- Program for array rotation
- Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5
- Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2
- Write a program to print all permutations of a given string
- Coin Change | DP-7
- Huffman Coding | Greedy Algo-3
- Activity Selection Problem | Greedy Algo-1
- Fractional Knapsack Problem
- Job Sequencing Problem
- Dijkstra’s Algorithm for Adjacency List Representation | Greedy Algo-8
- Minimum Number of Platforms Required for a Railway/Bus Station
- Program for Shortest Job First (or SJF) CPU Scheduling | Set 1 (Non- preemptive)
- Delete an element from array (Using two traversals and one traversal)
- Greedy Algorithm to find Minimum number of Coins
- Program for Least Recently Used (LRU) Page Replacement algorithm
- Minimize the maximum difference between the heights
- Difference between Prim's and Kruskal's algorithm for MST
- Rearrange characters in a string such that no two adjacent are same
- Program for Shortest Job First (SJF) scheduling | Set 2 (Preemptive)
- Connect n ropes with minimum cost
- Prim’s MST for Adjacency List Representation | Greedy Algo-6
- Graph Coloring | Set 2 (Greedy Algorithm)
- 3 Different ways to print Fibonacci series in Java
- Minimum cost to connect all cities
- Program for Page Replacement Algorithms | Set 2 (FIFO)
- Greedy approach vs Dynamic programming
- Find maximum meetings in one room
- Practice Questions on Huffman Encoding
- Applications of Minimum Spanning Tree Problem

Improve Article

Save Article

Like Article

Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.