Problems # Status Problem Level Completes Likes 246 Dijkstra's – Shortest Path Algorithm (SPT) Hard % 0 247 Replace all vowels with next consonant in a given string Medium % 0 248 Find the Area of a Triangle Using coordinates Beginner % 0 249 Java Program to find if Triangle can be formed using given 3 sides Beginner % 0 250 Convert Number to base 3 String Representation Beginner % 0 251 Find the Area of a Triangle Given Three Sides – Heron’s Formula Beginner % 0 252 Find Factorial of a given Number Beginner % 0 253 Reverse a String using Recursion Beginner % 0 254 Find Sum of all Digits of a Number Beginner % 0 255 Print maximum occurring character in a String Beginner % 0 256 Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation Hard % 0 257 Introduction to Minimum Spanning Tree (MST) Medium % 0 258 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Hard % 0 259 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Hard % 0 260 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Hard % 0 261 Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Hard % 0 262 Prim’s Algorithm - Minimum Spanning Tree (MST) Hard % 0 263 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 264 Disjoint Set | Union-Find Algorithm - Union by rank and path compression Hard % 0 265 Disjoint Set Data Structure - Union Find Algorithm Hard % 0 266 Graph – Count all paths between source and destination Medium % 0 267 Graph – Find Number of non reachable vertices from a given vertex Medium % 0 268 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 269 Graph – Detect Cycle in an Undirected Graph using DFS Medium % 0 270 Graph – Detect Cycle in a Directed Graph Medium % 0 271 Graph – Software Installation Problem Medium % 0 272 Snake and Ladder Problem Hard % 0 273 Weighted Graph Implementation – JAVA Beginner % 1 274 Graph – Depth First Search in Disconnected Graph Medium % 1 275 Topological Sort Medium % 0 276 Graph – Depth First Search using Recursion Beginner % 0 277 Graph Implementation – Adjacency Matrix | Set 3 Beginner % 0 278 Java Pair Class Beginner % 0 279 Graph Implementation – Adjacency List - Better| Set 2 Beginner % 0 280 Minimum Copy Paste Operations Medium % 0 Dijkstra's – Shortest Path Algorithm (SPT) Replace all vowels with next consonant in a given string Find the Area of a Triangle Using coordinates Java Program to find if Triangle can be formed using given 3 sides Convert Number to base 3 String Representation Find the Area of a Triangle Given Three Sides – Heron’s Formula Find Factorial of a given Number Reverse a String using Recursion Find Sum of all Digits of a Number Print maximum occurring character in a String Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation Introduction to Minimum Spanning Tree (MST) Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV) Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Prim’s Algorithm - Minimum Spanning Tree (MST) Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Disjoint Set | Union-Find Algorithm - Union by rank and path compression Disjoint Set Data Structure - Union Find Algorithm Graph – Count all paths between source and destination Graph – Find Number of non reachable vertices from a given vertex Graph – Detect Cycle in a Directed Graph using colors Graph – Detect Cycle in an Undirected Graph using DFS Graph – Detect Cycle in a Directed Graph Graph – Software Installation Problem Snake and Ladder Problem Weighted Graph Implementation – JAVA Graph – Depth First Search in Disconnected Graph Topological Sort Graph – Depth First Search using Recursion Graph Implementation – Adjacency Matrix | Set 3 Java Pair Class Graph Implementation – Adjacency List - Better| Set 2 Minimum Copy Paste Operations 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
