here it is my simple cash register app. It lacks some functionality ( class Payments should have more options like daily statements etc, class TillSettings needs more settings as well) but it does the job. Simple Cash Register and Stock Manager allows to add items to stock and then sell it and re...

I am trying to write a program that validates a password and then I extend the code to encrypt the password. I am getting a traceback error: Traceback (most recent call last): File "/Users//PycharmProjects/classtask/test.py", line 55, in <module> main() File "/Users//PycharmProjects/class...

Simple Disjoint Set Implementation I had not implemented a DisjointSet before and the following is my attempt at implementing a very simple DisjointSet for learning purposes. When union-ing sets, the goal was to implement union-by-size. Approach For simplicity, I implement a disjoint set that onl...

So I am doing a project where I upload a .txt file with gps coordinates of a train and when I press start the train starts moving on a map following that coordinates. I allready have a range bar on the page, but my question is... Is there any way that I can regulate the speed of the "train" on t...

I have written a simple code. I like someone to look at it and give if it does it do what it suppose to do in terms of: is it correctly using pointers? Is it overwriting in allocated memory i.e. like allocated smaller sized space but overwriting it with strcpy or is it free() allocated space #inc...

Got this problem in a coding interview - Get the max value of a stack in O(1). The stack contains numbers only. Please review my solution. Thanks class Stack { data; maxVal; pop() { return this.data.pop(); } insert(x) { const cm = new CheckMax(); this.data.push(x...

Problem definition : Array partition problem Given an array of positive integers, divide it into three disjoint subsets having equal sum. These disjoint sets cover the complete array. Example Input: [7, 6, 1, 7] Output: [[7], [6, 1], [7]] Input: [7, 6, 2, 7] Output: Not possible to partition in t...

The goal is to have a function that can sort a series of all object types that implement the comparable interface. I'm not trying to improve the performance of the sort. I'm only trying to optimize my use of generics. I currently use T extends whatever and T[], however I was also considering to u...

I joined a cipher challenge recently, and there are multiple decryption tasks there. One of the ways information on there is encrypted is with the Affine Cipher. Finding solutions to it is fairly simple, but I wish to avoid doing the crunch work of decrypting 3 paragraphs of writing after I have ...