OleksandrNibyt

USPSTestQA

Automated test for USPS website.

CalculatorTestQA

USPSPart2TestQA

Implementing automated test cases using Page Object pattern.

UPSTestQA

ConverterTestQA

Testing converter website: https://www.unitconverters.net/

APITesting

DecodeXORedArray

There is a hidden integer array arr that consists of n non-negative integers. It was encoded into another integer array encoded of length n - 1, such that encoded[i] = arr[i] XOR arr[i + 1]. For example, if arr = [1,0,2,1], then encoded = [1,2,3]. You are given the encoded array. You are also given an integer first, that is the first element of arr, i.e. arr[0]. Return the original array arr. It can be proved that the answer exists and is unique.

GoalParserInterpretation

Goal Parser Interpretation(LeetCode) - You own a Goal Parser that can interpret a string command. The command consists of an alphabet of "G", "()" and/or "(al)" in some order. The Goal Parser will interpret "G" as the string "G", "()" as the string "o", and "(al)" as the string "al". The interpreted strings are then concatenated in the original order. Given the string command, return the Goal Parser's interpretation of command.

RichestCustomerWealth

Richest Customer Wealth(LeetCode Problem) -You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ bank. Return the wealth that the richest customer has.

RandomSpotifySongs-

Finds random songs on Spotify and adds them to library

CounttheNumberofConsistentStrings

Count the Number of Consistent Strings - LeetCode problem.

SimpleHTTP_JavaServer

Simple HTTP server written in JAVA

TestAutomationJUnit

Practice with automation of tests

SudokuPyGUI

Sudoku game with GUI

SudokuPy

Sudoku solver written in python

Nodejs_API_Endpoints-

SpringBootTest

StringShuffling

LeetCode - String Shuffling

FindNumberswithEvenNumberofDigits

LeetCode - Find Numbers with Even Number of Digits

TargetArray

LeetCode - Create Target Array in the Given Order

DecompressRunLengthEncodedList

LeetCode - Decompress Run Length Encoded List

SubtractTheProductAndSumOfDigitsOfAnInteger

LeetCode - Subtract TheProduct And Sum Of Digits Of An Integer

smallerNumbersThanCurrent

LeetCode - How Many Smaller Numbers Than Current

XORinArray

LeetCode - XOR operator in an Array

JewelsAndStones

LeetCode - JewelsAndStones

NumberOfStepsToZero

LeetCode - NumberOfStepsToZero

DefangingAnIPAddress

LeetCode - DefangingAnIPAddress

Number-Of-Good-Pairs

LeetCode - NumberOfGoodPairs

CodingChallange_Pairs

LeetCode_Sum1DArray

Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums.