Commits · nickx720/leetcode-rust-repo ·

Commits on Nov 30, 2021

sort,iterate and return filter which matches target
nickx720
committed

Commits on Nov 29, 2021

sort,increment sum for every 2nd from last,keeping j less than length/3
nickx720
committed

Commits on Nov 26, 2021

decrement exchange from bottles, add one, add to total, return total + bottles left
nickx720
committed

Commits on Nov 25, 2021

use hashmap and store difference, return false in case above 4 in values
nickx720
committed

Commits on Nov 24, 2021

check if capacity is lower than plans,increment output with double plus i and refill capacity
nickx720
committed

Commits on Nov 23, 2021

sliding window to get max from k on either first sides and return max
nickx720
committed

Commits on Nov 22, 2021

get non dup elements, iterate and max between positions
nickx720
committed

Commits on Nov 19, 2021

dynammic programming solution for tribonacci series
nickx720
committed

Commits on Nov 18, 2021

use priority queue, loop until it is equal to 1,check if number is greater, true or false
nickx720
committed

Commits on Nov 17, 2021

dfs-> push item to result, each item to check if meets target, otherwise repeat
nickx720
committed

Commits on Nov 16, 2021

check boundary conditions and iterate through base3 to return answer
nickx720
committed

Commits on Nov 15, 2021

push items in a stack, iterate through s, if letter,pop from stack or push item from string
nickx720
committed

Commits on Nov 12, 2021

inverse the matrix and array length, and push items into the new array
nickx720
committed

Commits on Nov 11, 2021

keep two variables, with two loops, inner loop check if sum of power is less equal to bound
nickx720
committed

Commits on Nov 10, 2021

check product of matrix row and col is equal to r,c, if not return matrix, iterate through matrix based on column and reset column once reached max
nickx720
committed

Commits on Nov 9, 2021

dynammic programming to chart the course of unique path
nickx720
committed

Commits on Nov 8, 2021

reformat date
nickx720
committed

Commits on Nov 5, 2021

push into hashmap, filter based on count, get the one before k-1, unwrap for default case and return as string
nickx720
committed

Commits on Nov 4, 2021

calculate difference using priority queue and if no ladders or bricks are left return index otherwise length
nickx720
committed

Commits on Nov 3, 2021

sort the number, pair first and last and return the maximum from the vec
nickx720
committed

Commits on Nov 2, 2021

calculate the frequency of edges after summing each indiviudla row, return the highest edge after subtracting from length of wall
nickx720
committed

Commits on Nov 1, 2021

smallest index with equal value
nickx720
committed

Commits on Oct 29, 2021

check if length of matrix equals product of row and column, only then push each item from matrix to created vec
nickx720
committed

Commits on Oct 28, 2021

top down approach, adding minimum of next row to the current row, returning value at 0,0
nickx720
committed

Commits on Oct 27, 2021

set count, when reaching 1,if count is less than k return false or reset count, return true at end
nickx720
committed

Commits on Oct 26, 2021

sum up the matrixes, using hashmap, increment if already there, return the ans
nickx720
committed

Commits on Oct 25, 2021

max between count and output, reset count otherwise
nickx720
committed

Commits on Oct 22, 2021

using a stack, replace elments till i reaches k,return stack from 0..i
nickx720
committed

Commits on Oct 21, 2021

sort, zip and sum the difference of each member, return sum
nickx720
committed

Commits on Oct 20, 2021

sort and dedup the array and add it to a map to check the frequency
nickx720
committed

Commits on Oct 19, 2021

alternate till k, and increment from k to n, return the array
nickx720
committed

Commits on Oct 18, 2021

parse to remove strings, and check if in incrementing order otherwise return false
nickx720
committed

Commits on Oct 8, 2021

convert to string and then parse to number and sum
nickx720
committed

Commits on Oct 7, 2021

use memoization
nickx720
committed

Commits on Oct 6, 2021

check if current item is not equal to prev, increment ans with min of prev and cur, otherwise increment cur, return ans
nickx720
committed