saurabhdubey836 Goto Github PK

array-methods-api-and-dom

This projects explores the concept of array methods in JavaScript such as sort,forEach,map,reduce,filter

backend-web-tutorial

This folder contains the tutorial section of backend webdevelopment , follow the comments for more understanding

bidaf-keras

Bidirectional Attention Flow for Machine Comprehension implemented in Keras 2

c--implemented-codes

this repository includes c - codes for data structure

c-graphics-code

This repository includes various c- codes and their projects such as sorting and searching

certificates

It includes all my certificates

codinguru

competitive-programming

This is a collection of useful Competitive Programming material!

css-mysite

My website

custom-video-player-

This is a Custom Video player built using (HTML ,CSS and Vanilla JavaScript)

data-structures-notes

It includes code for various data structures Notes from Udemy as I am completing my Udemy course

day1-vanilla-js-form-

This is my Vanilla JavaScript project

devtraining-needit-utah

dice-game

Follow up some projects in JS

dicee-game

This is a dice game made by me so that.

drum-kit-udemy-angela-

This is the Drum Kit Challenge

exchange-rate-calculator

This is a exchange rate calculator using exchange rate API

ff

gitlab_test-empiler-task

greedy-algorithms

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following property: At every step, we can make a choice that looks best at the moment, and we get the optimal solution of the complete problem. If a Greedy Algorithm can solve a problem, then it generally becomes the best method to solve that problem as the Greedy algorithms are in general more efficient than other techniques like Dynamic Programming. But Greedy algorithms cannot always be applied. For example, Fractional Knapsack problem (See this) can be solved using Greedy, but 0-1 Knapsack cannot be solved using Greedy.

hangman-game

This is my simple Hangman project prepared with HTML,CSS and Javascript

html-and-css-masterclass

Master HTML & CSS By Building [15 Projects ] 🤘 HuXn webdev

html-calculator

html-css

Some of my work

interviewbit

My solutions to tasks from site

javaexercises

leetcode-30-days-java-solutions

This repository contains the solution of all the leetcode 30 days coding Challege held in April.

movie-ticket-book-in-java-script-

operating-system-codes

This repository includes various c- codes and their projects such as sorting and searching

php-mysql-projects

These include some of my projects like Book Record Management.