Sparsh Pai (Sparsh2234)

Sparsh2234

Geek Repo

0

following

0

stars

Home Page:https://www.linkedin.com/in/sparshpai/

Github PK Tool:Github PK Tool

Sparsh Pai's repositories

Android-Trivia-Application

A Nifty Trivia App!

Stargazers:0Issues:0Issues:0

cv

Personal website

Language:HTMLStargazers:0Issues:0Issues:0

DataGrapher

This software creates Frequency, Relative Frequency, and Cumulative Frequency graphs based on given sets of data.

Language:JavaStargazers:0Issues:0Issues:0

DeltaHacks

McMaster DeltaHacks 1st Place Overall

Language:CSSStargazers:0Issues:0Issues:0
Language:JavaStargazers:0Issues:0Issues:0

GraphQL-MongoDB-Sample-Server

Sample server using GraphQL and MongoDB

Language:JavaScriptStargazers:0Issues:0Issues:0

History-Manager

Implemented a double ended dequeue data structure using a doubly linked list to support various data manipulations. Architected project to achieve O(1) runtime for multiple functions and O(N) worst case.

Language:C++Stargazers:0Issues:1Issues:0

iOS_Trivia_App

A simple iOS application

Language:SwiftStargazers:0Issues:0Issues:0

Messenger-app

Realtime messaging app developed with SwiftUI and AWS Amplify

Language:SwiftStargazers:0Issues:0Issues:0

MST-Greedy-Algorithm-Program

Implemented MST (Minimum Spanning Tree) for a weighted, undirected graph using Prim’s algorithm. The program uses an 'adjacency list' and 'edge matrix' to support various commands and manipulations. These include: calculating MST value, finding the degree of a vertex, inserting/deleting edges, etc.

Language:C++Stargazers:0Issues:0Issues:0

StarterHacks

This repository holds the project created during StarterHacks - 2020

Language:PythonStargazers:0Issues:1Issues:0

Social-app

Social media app with a React Native front-end and Firebase back-end

Language:JavaScriptStargazers:0Issues:0Issues:0

Sparsh2234

Config files for my GitHub profile.

Stargazers:0Issues:0Issues:0

Trie-Data-Structure-Program

Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and the kth letter of the alphabet (where ‘a’ is the 0th letter).

Language:C++Stargazers:0Issues:1Issues:0

YorkUHacks

Winner of the Lassonde School of Engineering 50:50 Challenge

Language:HTMLStargazers:0Issues:0Issues:0