This is a battleship console game I wrote in C++. #include <string> #include <iostream> #include <process.h> #include <cstdlib> #include <time.h> using namespace std; int const ROW = 3; int const COL = 3; int subX, subY; int guesses = 5; int board[ROW][COL]; bool hasWon = false; void winScreen() { cout << “You won with ” … Read more
Here is my code for removing duplicated values from an array. I think I tested it with the most possible cases. Any suggestions or bugs? class duplicate { public static int[] removeDuplicates(int[] arr) { int end = arr.length; for (int i = 0; i < end; i++) { for (int j = i + 1; … Read more
Do 3 arrays contain a common element, if they contain output it. For example: [1,2,3], [2,3], [2,4] -> answer = 2 let arr1 = [1, 3, 11, 32, 44, 99]; let arr2 = [4, 12, 15, 99]; let arr3 = [4, 11, 13, 15, 23, 43]; function searchThreeSameNum(arr1, arr2, arr3) { let i = 0; … Read more
Given a 2D array of unsigned integers and a maximum length n, find a path in that matrix that is not longer than n and which maximizes the product of the elements in the path. The output should consist of both the path and the product. A path consists of neighbouring integers that are either … Read more
I have two different arrays that are widely different in length, arrayA, arrayB for example:arrayA.Length=1000 and arrayB.Length=100,000 Create a boolean function that returns true if each item in arrayA are also present in arrayB, at least the same number of times as in arrayA. Please review my code below and help me with siuggestions to … Read more
I have a nested object which I need to filter and sort. I have a nested Object where some keys like app1 are nested inside another object. I need to be able to filter out objects with the status of True. I also need to be able to sort by date irrespective of how deep … Read more
I found a challenge on /r/dailyprogrammer that I figured seemed fun to solve: a packet assembler. I solved it, but the feedback on that subreddit is lacking, which is why I turn to you. Each input line is structured like so: 6220 1 10 Because he’s the hero Gotham deserves, Where the first 4 digits … Read more
Array A contains the elements, A1,A2,…,AN. And array B contains the elements, B1,B2,…,BN. There is a relationship between Ai and Bi: any element Ai lies between 1 and Bi. Let the cost S of an array A be defined as: S=N∑i=2|Ai−Ai−1| Given B, find and print the largest possible value of S. The problem can … Read more
How is my implementation? Are there improvements I can make to the variable names or any edge cases I might have missed? public class ZeroMatrix { public static void main(String[] args) { int[][] matrix = new int[][]{ {1, 0, 2}, {3, 4, 1} }; System.out.println(Arrays.deepToString(setZeroes(matrix))); } private static int[][] setZeroes(int[][] matrix) { boolean[] rowsWithZero = … Read more
I need to convert f32 arrays with a fix length to base64 representation and back. My current code looks like this. It works, but it feels way too complicated. How can I improve it? main.rs: extern crate base64; fn read_float_vec_from_byte_vec(v: Vec<u8>) -> Result<Vec<f32>, String> { match v.len() % 4 { 0 => { use std::ptr; … Read more
