CSI (Hit Student's Branch)
GitHub

CSI (Hit Student's Branch)

@csihit

View GitHub Profile
Followers 6
Following 0
Public Repositories 41
Expertise

Skills & Technologies

CSS C++ JavaScript
GitHub Work

Projects & Repositories

Recent public projects and repositories from this profile.

Typing-Speed-Test

CSS

A modern Typing Speed Test built with HTML, CSS, and JavaScript. Test your typing skills with real-time WPM, accuracy, error, and timer tracking. Get instant feedback on every keystroke and improve your typing speed through an interactive and responsive interface.

⭐ 0 Forks: 0

Aho-Corasick-Algorithm

C++

Aho–Corasick Algorithm implemented in C++ using Trie and Failure Links for efficient multi-pattern searching. Finds multiple patterns in a single text traversal, making it ideal for large-scale text processing, search systems, cybersecurity, and computational biology.

⭐ 0 Forks: 0

Apple-Dynamic-Island-Animation

CSS

A sleek Apple Dynamic Island Animation built using HTML, CSS, and JavaScript. It recreates the iconic Dynamic Island experience with smooth expand/collapse animations, interactive notifications, fluid micro-interactions, and a responsive design. Lightweight, modern, and easy to understand for learning UI animations.

⭐ 0 Forks: 0

Dinic-s-Algorithm-Finding-Maximum-Flow

C++

Dinic's Algorithm- Finding Maximum Flow , implemented in C++ using BFS-based Level Graphs and DFS-driven Blocking Flows for efficient maximum flow computation in directed networks. Clean, optimized, and ideal for competitive programming and graph algorithms.

⭐ 0 Forks: 0

Gravity-Based-Falling-Text

JavaScript

Gravity-Based Falling Text built with HTML, CSS, and JavaScript featuring realistic gravity physics, smooth animations, collision detection, and responsive interactions. Designed to create dynamic, engaging text motion with a clean, interactive, and visually appealing experience.

⭐ 0 Forks: 0
JavaScript View Project

Tarjan-s-Algorithm-efficiently-finds-Strongly-Connected-Components-SCCs-

C++

An efficient C++ implementation of Tarjan's Algorithm to find Strongly Connected Components (SCCs) in a directed graph using DFS, low-link values, and a stack. Runs in O(V + E) time, making it ideal for graph analysis, dependency resolution, and competitive programming.

⭐ 0 Forks: 0