Pinned Repositories
Calculator
Simple Calculator using HTML, CSS and JS
ChangeBg
Clock
Counter
Ecommerce-App
Functional-Components
Here is a simple code of showing a very important concept in Reactjs that is Functional Components
Greeting-using-React
My-top-5-netflix
Rock-paper-scissors
Fun page with 3 different challenges: 1)Age in days 2)Generate pizza 3)Rock paper scissors
SlotMachine
Simple fun Slot Machine
ishitacs's Repositories
ishitacs/Calculator
Simple Calculator using HTML, CSS and JS
ishitacs/ChangeBg
ishitacs/Clock
ishitacs/Counter
ishitacs/Functional-Components
Here is a simple code of showing a very important concept in Reactjs that is Functional Components
ishitacs/Greeting-using-React
ishitacs/My-top-5-netflix
ishitacs/Rock-paper-scissors
Fun page with 3 different challenges: 1)Age in days 2)Generate pizza 3)Rock paper scissors
ishitacs/SlotMachine
Simple fun Slot Machine
ishitacs/snakegame
Fun classic snake game
ishitacs/Ecommerce-App
ishitacs/BeyondSkool-Teacher-calendar-and-Form
ishitacs/DigitalClock
A digital clock using hooks in react
ishitacs/Dynamic-Programming
Dynamic Programming (DP) is an algorithmic technique for solving an optimization problem by breaking it down into simpler subproblems and utilizing the fact that the optimal solution to the overall problem depends upon the optimal solution to its subproblems.
ishitacs/Ecommerce
ishitacs/Events
Changing background and button text using events and usestate in ReactJs
ishitacs/Gfg-Algorithm
ishitacs/Graphs
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph
ishitacs/Heap
ishitacs/Hooks
Simple Counter using Hooks in Reactjs
ishitacs/Important-Algorithms-
An algorithm is a procedure or formula for solving a problem, based on conducting a sequence of specified actions
ishitacs/InterviewBit
Find easy solutions of all interview bit problems in c++
ishitacs/LeetCode
Optimized solutions in c++ of programming problems from Leetcode
ishitacs/Renown-Website
ishitacs/Stack
ishitacs/Stacks-Queues
ishitacs/ToDo-List
ishitacs/Trees-Questions
ishitacs/TreeTraversal
Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. Following are the generally used ways for traversing trees.Depth First Traversals: (a) Inorder (Left, Root, Right) : 4 2 5 1 3 (b) Preorder (Root, Left, Right) : 1 2 4 5 3 (c) Postorder (Left, Right, Root) : 4 5 2 3 1 Breadth First or Level Order Traversal : 1 2 3 4 5