Popular repositories Loading

1. Best-Time-to-Buy-and-Sell-Stock-Leetcode-Problem Best-Time-to-Buy-and-Sell-Stock-Leetcode-Problem Public

   You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day i…

   2

2. Best-Time-to-Buy-and-Sell-Stock-II-Leetcode-Problem Best-Time-to-Buy-and-Sell-Stock-II-Leetcode-Problem Public

   You are given an integer array prices where prices[i] is the price of a given stock on the ith day. On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of …

   2

3. To-Do-List-with-LocalStorage-Project To-Do-List-with-LocalStorage-Project Public

   To-Do List is an application will be like a task-keeper where the user would be able to enter the tasks that they need to do. Once they are done with their tasks they can also remove them from the …

   CSS 1

4. Rope-Cutting-GFG-Problem Rope-Cutting-GFG-Problem Public

   You are given N ropes. A cut operation is performed on ropes such that all of them are reduced by the length of the smallest rope. Display the number of ropes left after every cut operation until t…

   1

5. Sorting_Visualizer-Project Sorting_Visualizer-Project Public

   A web application showcasing the inner workings of 6 sorting algorithms with colors representing steps being executed.

   JavaScript 1

6. Stock-buy-and-sell-GFG-Problem Stock-buy-and-sell-GFG-Problem Public

   The cost of stock on each day is given in an array A[] of size N. Find all the days on which you buy and sell the stock so that in between those days your profit is maximum. Note: Since there can b…

   1