ayush2514's repositories
JobPortal
Job Portal app is a powerful tool for job seekers, built with React Native using the Expo CLI. It utilizes the JSearch API from RapidAPI Hub to search for jobs in real-time from major job sites like LinkedIn, Indeed,etc With custom hooks for fetching data, dynamic stylesheets, and responsive design, our app provides an exceptional user experience.
DSA
A comprehensive collection of Data Structures and Algorithms (DSA) implementations in Java. This repository aims to provide well-documented and efficient code examples for common DSA problems, serving as a valuable resource for learning and practicing DSA concepts.
LeetGfg
Storing all the codes at one place
SearchApplication
Built a simple Search Application using RedirectView
my-portfolio
Build a personal portfolio website using React and Animate CSS.
chatapp
CHAT APP PROJECT WITH FIREBASE & CHAKRA UI
Product-Management-System-PostgreSQL
A short Spring boot project to test CRUD application
Tic-Tac-Toe
Tic-tac-toe is a two player game (one of them being your computer program). The two players take turns putting marks on a 3x3 board. The player who first gets 3 of his/her marks in a row (vertically, horizontally, or diagonally) wins the game, and the other loses the game. In this project, I have built this game using React Js library.
CrackYourPlacement
A directory which contains all the DS-Algo Codes
coursera-test
Coursera Test repository
Product-Management-SpringBoot
Spring Boot Application which involves CRUD operations using MYSQL as a database
COVID-19-Tracker
This is a web-based project to know about the current statistics of COVID-19 in India as well as globally.
newsApp
A web-based app to check news from different regions
Next-Round
"Contestant who earns a score equal to or greater than the k-th place finisher's score will advance to the next round, as long as the contestant earns a positive score..." — an excerpt from contest rules. A total of n participants took part in the contest (n ≥ k), and you already know their scores. Calculate how many participants will advance to the next round. Input The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 50) separated by a single space. The second line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 100), where ai is the score earned by the participant who got the i-th place. The given sequence is non-increasing (that is, for all i from 1 to n - 1 the following condition is fulfilled: ai ≥ ai + 1). Output Output the number of participants who advance to the next round.
Sorting-Visualizer
Visualization Tool for Sorting Algorithms