Peter Kofi Turkson Asamoah's Projects
Simple linked list program involving adding two numbers
Given a string, split it into two contiguous substrings of equal length. Determine the minimum number of characters to change to make the two substrings into anagrams of one another
ATM simulator using java swing
challenge is to find an element of the array such that the sum of all elements to the left is equal to the sum of all elements to the right.
Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums.
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
Simple program using bubble sort algorithm
Caesar's cipher shifts each letter by a number of letters. If the shift takes you past the end of the alphabet, just rotate back to the front of the alphabet. In the case of a rotation by 3, w, x, y and z would map to z, a, b and c.
Caesar's cipher shifts each letter by a number of letters. If the shift takes you past the end of the alphabet, just rotate back to the front of the alphabet. In the case of a rotation by 3, w, x, y and z would map to z, a, b and c.
Testing out strreams on students and lectures classes
Return the player's rank after each new score
Simple program to convert roman numerals to numbers considering the 6 special cases of subtraction ie 4,9,40,90,400,900
Louise and Richard have developed a numbers game. They pick a number and check to see if it is a power of 2. If it is, they divide it by . If not, they reduce it by the next lower number which is a power of .
Given a list of integers, count and return the number of times each value appears as an array of integers.
Given a square matrix, calculate the absolute difference between the sums of its diagonals.
Determine how many ways to divide the chocolate.
Declare a 2-dimensional array, , of empty arrays. All arrays are zero indexed
The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1.
Given an array of distinct integers, transform the array into a zig zag sequence by permuting the array elements.
You will be given a list of 32 bit unsigned integers. Flip all the bits ( and ) and return the result as an unsigned integer.
Given the initial configurations for matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.