🚀 A task launcher plugin for neovim allowing dynamic task configuration per directory, with optional support for debugging

This C++ program demonstrates basic object-oriented programming principles through the implementation of a Fraction class. It includes constructors, destructor, operator overloading, and exception handling for division by zero. Users can input two fractions, and the program will calculate their sum.

This project builds Hangman game (a word game) logically and with graphical representation of the hanging man.

An expense tracker project in Python is a useful application that helps users keep track of our expenses and manage the budget.

This repository contains a Java implementation of a BinaryTree class, with methods for inserting nodes and performing in-order, pre-order, and post-order traversals.

A Python-based bill splitting tool that allows users to divide the bill evenly among friends, with an optional feature to randomly exempt one person from paying.

This Python script creates a chat application using Tkinter. Users can interact with a bot that fetches info from Wikipedia, displays images from Unsplash, and downloads YouTube videos. It features logging for error handling.

Java implementation of MaxHeap and MinHeap data structures with sorting functionalities. The program prompts the user to input the number of nodes and their values, constructs both max and min heaps, and performs sorting to obtain ascending and descending order sorted arrays, respectively.

Developing this game was my first big attempt at game development and OOP in Python, learning valuable skills in implementing game mechanics, graphics rendering, collision detection, and user input handling.

A simple password manager built with Python using the tkinter library. This program allows users to generate secure passwords and store them along with website and email details. The passwords are saved locally in a text file (`data.txt`) for easy retrieval.

Java implementations of Selection Sort and Quick Sort algorithms. It sorts an array of integers first in descending order using Selection Sort, then applies Quick Sort to sort the previously sorted array in ascending order. The program then displays the input array along with both sorted arrays.

An interactive web application designed to track and log workouts using geolocation and map functionalities. The app allows users to add details about their activities, such as running or cycling, and visualize their workout locations on an interactive map. This project highlights working with third-party API and user input handling.

A Python tool for translating text between languages and converting the translation into audio. Using `googletrans` for translation and `gTTS` for text-to-speech, this project provides a simple way to create multilingual audio content directly in a Jupyter Notebook environment.

Implementing a Tic-Tac-Toe game using TCP/IP client-server communication in Java. This project allows two players to connect over a network, playing the classic game in a turn-based fashion.

This is a simple yet functional calculator project implemented in Python. It provides basic arithmetic operations including addition, subtraction, multiplication, and division. It is designed using fundamental concepts of Python programming, such as functions, user input handling, and basic error handling.

This repository contains a project focused on creating a voting form, demonstrating the design and functionality of an online voting system. It includes form validation and user input handling to ensure a smooth voting experience.

Program that implements 4 common ciphers (Atbash, Caesar, Affine, & Viginere) to encode and decode messages

Snake Game: A classic implementation of the popular Snake game in Java using Swing. Control the snake, eat apples, and avoid collisions to win!

Defines a model view controller system to generate plots (stories) in two ways: randomly and interactively, using data from text files.

The program prompts the user to input the number of nodes and edges, followed by the edges in the format of endpoints (u, v). It constructs the adjacency matrix and performs BFS traversal to visit all nodes. Finally, it displays the adjacency matrix and the BFS visit sequence of the graph.