Skip to content

Instantly share code, notes, and snippets.

View Nasah-Kuma's full-sized avatar

Mantoh Nasah Kuma Nasah-Kuma

View GitHub Profile
@Nasah-Kuma
Nasah-Kuma / atoken.sol
Last active November 12, 2023 14:45
A smart contract that allows the deposit of a token created, and users can only withdraw it after 70 blocks from when it was deposited.
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;
contract MyToken {
string public name;
string public symbol;
uint8 public decimals;
uint256 public totalSupply;
mapping(address => uint256) public balanceOf;
mapping(address => mapping(address => uint256)) public allowance;
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;
contract HealthRecordRepository {
enum AdmissionStatus { Admitted, NotAdmitted }
struct HealthRecord {
uint256 recordID;
string patientName;
uint256 age;
@Nasah-Kuma
Nasah-Kuma / heathRecordRepo.sol
Created October 31, 2023 14:20
In this contract, the HealthRecord struct represents a patient's health record, and it includes various data points such as recordID, patientName, age, diagnosis, treatment, medications, and isAdmitted. The addHealthRecord function allows adding a new health record to the repository, while the getPatientRecords and getRecordByID functions enable…
// SPDX-License-Identifier: MIT
pragma solidity ^0.8.0;
contract HealthRecordRepository {
struct HealthRecord {
uint256 recordID;
string patientName;
uint256 age;
string diagnosis;
string treatment;
/*
* Complete the 'miniMaxSum' function below.
*
* The function accepts INTEGER_ARRAY arr as parameter.
*/
function miniMaxSum(arr) {
// Write your code here
arr.sort();
/*
* Complete the 'sockMerchant' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER n
* 2. INTEGER_ARRAY ar
*/
function sockMerchant(n, ar) {
function plusMinus(arr) {
// Write your code here
let plusCount = 0;
let minusCount = 0;
let zeroCount = 0;
const n = arr.length;
for (const i of arr) {
if(i < 0) minusCount++;
if(i > 0) plusCount++;
/*
* Complete the 'minimumNumber' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER n
* 2. STRING password
*/
function minimumNumber(n, password) {
function camelcase(s) {
// Write your code here
let wordCount = 1;
let i = 0;
while (i < s.length) {
if(s[i].toUpperCase() === s[i]) wordCount++;
i++;
}
return wordCount;
}
/*
* Complete the 'climbingLeaderboard' function below.
*
* The function is expected to return an INTEGER_ARRAY.
* The function accepts following parameters:
* 1. INTEGER_ARRAY ranked
* 2. INTEGER_ARRAY player
*/
function climbingLeaderboard(ranked, player) {
/*
* Complete the 'bonAppetit' function below.
*
* The function accepts following parameters:
* 1. INTEGER_ARRAY bill
* 2. INTEGER k
* 3. INTEGER b
*/
function bonAppetit(bill, k, b) {