bfs-dfs

A curated repository of solved LeetCode and DSA problems mapped across core algorithmic patterns, optimized for top-tier software engineering interviews.

Data structure and algorithms are two of the most important aspects of computer science. Data structures allow us to organize and store data, while algorithms allow us to process that data in a meaningful way.

🚀 This repository contains my structured journey of mastering Data Structures & Algorithms (DSA) through core problem-solving patterns using C++. 🧠 I'm focusing on learning smart, not just more - by practicing important problem-solving strategies.

A basic shell interface that supports the execution of a series of commands.

The "Plan a Flight Project" is a software that uses graph data structures and backtracking algorithms to plan efficient flight routes between cities, outputting the top 3 plans based on time or cost. It's run from the command line and follows robust OOP design principles.

This repository is my personal DSA playground, dedicated to self-improvement and skill enhancement. Through diverse coding challenges and detailed solutions, I aim to refine my Data Structures and Algorithms expertise. Join me in this journey of continuous learning and growth in the realm of computer science.

Practicals from sem 5 of bsc IT,Third year

Some interesting problems I solved on competition platforms such as codeforces

Repository of all programs implemented in the AIML Lab at SDMCET, 2025.

All the important graph algorithms and problems

DFS and BFS finder + Graph connectivity

This repository contains a curated collection of Data Structures and Algorithms (DSA) problems along with detailed solutions. It serves as a valuable resource for individuals preparing for technical interviews and seeking to enhance their coding skills. The problems are categorized by topic and difficulty, accompanied by clear explanations and code

An interactive graph algorithm engine modeling a localized transit network (Navi Mumbai). Computes multi-criteria optimal routing (time, distance, tolls) utilizing Dijkstra's Min-Heap implementation and provides geographical network visualizations via NetworkX.

A simple maze creator and solver in Python

This project is based on the UC Berkeley CS188 Pacman AI framework, implementing and testing algorithms and multi-agent search strategies for Pacman.

A simple python web crawler for searching through web and fetching data. Useful for finding content in web and fetching links.

Tree traversal algorithms - BFS/DFS. Preorder, Inorder, Postorder traversal.

DSA Interview Prep: A comprehensive collection of Data Structures and Algorithms (DSA) interview problems and their solutions, designed to help candidates prepare effectively for technical interviews. This repository includes a variety of problems and solutions in multiple programming languages, making it a valuable resource for software engineers.

Interactive pathfinding visualizer — BFS, DFS, Dijkstra & A* implemented in C++ compiled to WebAssembly. Watch algorithms explore a grid in real-time with maze generation, weighted nodes & algorithm comparison mode.