akashchaudhuri20 Goto Github PK

binary-search-tree-validator

This code validates whether a tree is a binary search tree.

buy-and-sell-stock

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 in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

comment-app

React based basic comment app

contains-duplicate

Given an integer array 'nums', return true if any value appears at least twice in the array, and return false if every element is distinct.

employee-polls-project

hacktoberfest2023

Hacktoberfest 2023 OPEN FIRST Pull Request - FREE T-SHIRT🎉

image-processing-api

The Image Processing API enables the user to resize any locally stored image

maximum-product-sub-array

Given an integer array 'nums', find a contiguous non-empty subarray within the array that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. A subarray is a contiguous subsequence of the array.

maximum-sub-array

Given an integer array 'nums', find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array.

minimum-in-rotated-sorted-array

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]]. Given the sorted rotated array nums of unique elements, return the minimum element of this array. You must write an algorithm that runs in O(log n) time.

product-of-array-except-self

Given an integer array 'nums', return an array answer such that answer[i] is equal to the product of all the elements of 'nums' except nums[i]. The product of any prefix or suffix of 'nums' is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation.

staircase-pattern-printer

This class consumes an integer (height) and prints staircase patterns

student.placement.portal

two-sum

Given an array of integers 'nums' and an integer 'target', return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.

valid-parentheses

Given a string 's' containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if - 1. Open brackets must be closed by the same type of brackets. 2. Open brackets must be closed in the correct order.