peterturkson102 Goto Github PK

smallest-negative-balance

we need to find the balance (Lender - Borrower).

sockmerchant

Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are.

sorted_rotated_array_java

sort_array_of_0-1-2

Simple program to sort an array of numbers 0, 1 and 2

string-isvalid-function

stringsxor

Given two strings consisting of digits 0 and 1 only, find the XOR of the two strings.

sumxor

Given an integer , find each such that: where denotes the bitwise XOR operator. Return the number of 's satisfying the criteria.

superdigit

Given an integer, we need to find the super digit of the integer.

superdigit-recursive-

testing

new test

testingstream

Testing out streams using student and lectures data

text-editor

Implement a simple text editor. The editor initially contains an empty string, . Perform the ff operations

timeconversion

Given a time in 12-hour AM/PM format, convert it to military (24-hour) time. Note: - 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock. - 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock.

tlc-trading-lab

Lab work for Trading System. TLC 4.

tlc-trading-lab-1

Lab exercise for Trading System. TLC 4.

tlcexchange

tocamelcase

Convert a string to camelcase

tower-of-hanoi

Simple java towwer of hanoi game

towerbreakers

Two players are playing a game of Tower Breakers! Player always moves first, and both players always play optimally.

trade

trading

trucktour

Petrol and distance.

twoarrays

twosum

LeetCode 1 solution. 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.

twosum-solution

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

urlshortener

A URL Shortener Service built with Java, Spring Boot, and Redis

vowelscount

Count of Vowels in a string

waiter-challenge

Determine if the number on the plate is evenly divisible by the prime number. If it is, stack it in pile . Otherwise, stack it in stack . Store the values in from top to bottom in . In the next iteration, do the same with the values in stack . Once the required number of iterations is complete, store the remaining valu

wholikesit

Implement the function which takes an array containing the names of people that like an item. It must return the display text

words-in-string-reversal

Reverse words in a string with a length more than 5