Ishita Arora (ishitacs)

ishitacs

Geek Repo

Location:Delhi

Github PK Tool:Github PK Tool

Ishita Arora's repositories

Calculator

Simple Calculator using HTML, CSS and JS

Language:JavaScriptStargazers:1Issues:0Issues:0
Language:HTMLStargazers:1Issues:0Issues:0
Language:JavaScriptStargazers:1Issues:0Issues:0
Language:HTMLStargazers:1Issues:0Issues:0

Functional-Components

Here is a simple code of showing a very important concept in Reactjs that is Functional Components

Stargazers:1Issues:0Issues:0
Language:HTMLStargazers:1Issues:0Issues:0
Language:JavaScriptStargazers:1Issues:0Issues:0

Rock-paper-scissors

Fun page with 3 different challenges: 1)Age in days 2)Generate pizza 3)Rock paper scissors

Language:JavaScriptStargazers:1Issues:0Issues:0

SlotMachine

Simple fun Slot Machine

Language:JavaScriptStargazers:1Issues:0Issues:0

snakegame

Fun classic snake game

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

DigitalClock

A digital clock using hooks in react

Language:HTMLStargazers:0Issues:0Issues:0

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.

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

Events

Changing background and button text using events and usestate in ReactJs

Language:HTMLStargazers:0Issues:0Issues:0
Stargazers:0Issues:0Issues:0

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

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

Hooks

Simple Counter using Hooks in Reactjs

Language:HTMLStargazers:0Issues:0Issues:0

Important-Algorithms-

An algorithm is a procedure or formula for solving a problem, based on conducting a sequence of specified actions

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

InterviewBit

Find easy solutions of all interview bit problems in c++

Stargazers:0Issues:0Issues:0

LeetCode

Optimized solutions in c++ of programming problems from Leetcode

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

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

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