2685. Count the Number of Complete ComponentsDifficulty: MediumTopics: Depth-First Search, Breadth-First Search, Union Find, GraphYou are given an integer n. There is an undirected graph with n vertic...
Problem Statement
You are in a city with n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections. The inputs are generated such that you can reach any in...
Today, I began my journey of creating a delightful DSA Visualizer. I've always found data structures and algorithms challenging and often felt bored by the repetitive exercises. As a programmer once s...
1976. Number of Ways to Arrive at DestinationDifficulty: MediumTopics: Dynamic Programming, Graph, Topological Sort, Shortest PathYou are in a city that consists of n intersections numbered from 0 to ...
Day 2 was focused on turning plans into pixels as I built the user interface for my DSA Visualizer. I aimed to create an engaging and easy-to-use layout that not only looks sleek but also makes explor...
Main idea
Imagine you're invited to a party, and as soon as you arrive, the person who invited you introduces you to someone else at the event. You both shake hands and form a connection, sta...
Program that uses the bubble sort and quick sort algorithms to sort book titles and authors in csv files.https://github.com/Ramenchu/Algorithms_To_Sort_Books.git...
A program that uses dynamic programming to find the longest common subsequence between strings.https://github.com/Ramenchu/Longest_Common_Subsequence.git...