JayrajShah
I'm a Creator & Programmer. WebApps Development and Design Assistance
Navsari, Gujarat, India
JayrajShah's Stars
facebook/react-native
A framework for building native applications using React
floating-ui/floating-ui
A JavaScript library to position floating elements and create interactions for them.
covid19india/covid19india-react
Tracking the impact of COVID-19 in India
JayrajShah/RegistrationForm-JSP
A simple registration form using JSP and HTML. Form reads the input and displays on the next page. NO DATABASE USED
JayrajShah/ChattingSystem-TCP
A Simple Chatting System between Server and Client using TCP
maheksa1234/question.c-
msspoorthi/pro8
Suchitraheggade/Hacker
5. Hacker and traffic lights Zolo is stuck in a traffic due to dysfunctional traffic light. Zolo is a professional hacker and he can get into the system and change the state of the light. His planet has different types of traffic lights such that there are N bulbs on the traffic board and only when all of them are green(G) the cars can pass. there are 2 other states also which the bulb can show; i.e. Red(R) & Yellow(Y). Note that the lights are designed such that they follow a state change cyclic pattern as follows: R------>Y------>G------->R Once Zolo gets into the system he can select any position i and update all elements between i to min(N, i + K - 1) by increasing their state by 1.This whole process takes 1 sec and he can repeat this process any no. of times until he gets all lights = G . Find the minimum time to do the process as Zolo is getting late for work.
ASHIKA-05/pubg.c
JayrajShah/Last-Occurrence
You have been given an array of size N consisting of integers. In addition you have been given an element M you need to find and print the index of the last occurrence of this element M in the array if it exists in it, otherwise print -1. Consider this array to be 1 indexed.
Kiranshetty22/Last-Occurrence
akshatkhandelwal1/akshat-repository
JagathHaren/Frustrated-coders
There are N frustrated coders standing in a circle with a gun in their hands. Each coder has a skill value S[ i ] and he can only kill those coders that have strictly less skill than him. One more thing, all the guns have only 1 bullet. This roulette can take place in any random order. Fortunately, you have the time stone (haaan wo harre wala) and you can see all possible outcomes of this scenario. Find the outcome where the total sum of the remaining coder's skill is minimum. Print this sum.
akshatkhandelwal1/Target-Practice
JayrajShah/Memorise-Me
Arijit is a brilliant boy. He likes memory games. He likes to participate alone but this time he has to have a partner. So he chooses you. In this Game , your team will be shown N numbers for few minutes . You will have to memorize these numbers. Now, the questioner will ask you Q queries, in each query He will give you a number , and you have to tell him the total number of occurrences of that number in the array of numbers shown to your team . If the number is not present , then you will have to say “NOT PRESENT” (without quotes).
akshatkhandelwal1/akshatkhandelwal1.Github.io
JayrajShah/Mico-and-Array-Update
pranavlm/dbms-mini-project
alvas-education-foundation/4AL17IS048_Hari
Daily Progress
Kiranshetty22/Hamiltonian-and-Lagrangian
Kiranshetty22/Kiranshetty22.github.io
Kiranshetty22/monk-and-welcome-problem
spoorthybalaji/python1
elstonds/elston12133
msspoorthi/oddandeventhred
pranavlm/phython-solution
sharshithkumar/sharshithkumar.github.io