I have written a program in C++ that takes in string values for contact names and contact phone numbers into vectors. What I need to do is have the program output the corresponding phone number for the contact name entered. (Note: The '3' is supposed to tell the program how many values are to be ...

I have made most of the review changes based on feedback I have got from here. Now I am back here for a second review to further better my code. Before posting the changes, somethings I haven't changed are the following. I have left the print statements as-is for now. The reason for this is, at ...

I wrote the following function to get all possible m-of-n combinations, sorted and without repetition. I am new to Go and I am wondering what are the possible enhancements I can make, in terms of performance and best practices. Input is: m and an array of strings Output is: an array all possible ...

I have implemented a deque using an array, called 'ArrayDeque'. Then I used this ArrayDeque to implement a stack, 'myStack'. In the stack class, I am writing a method that can remove the top 'n' elements from the stack in constant time, called 'remove(int n)'. Following are the relevant code snip...

I have a valid code in C-style int arr[10][10] = {0}; // all elements of array are 0 What is the optimal way to do the same for C++ style array? My idea is #include <array> std::array<std::array<int, 10>, 10> arr = {0}; // is it correct?

Is my approach to book a room in a conference hall: PUT: api/v1/rooms/book/1 GET: api/v1/rooms/1 POST: api/v1/rooms fits REST architecture?

This is a very simple FFT, I am wondering what I can do to make this faster and more memory efficient from the programming side (better data types, and maybe some tricks like unrolling loops or using the preprocessor if that is useful here), and not by using a more efficient mathematical algorith...

I'm trying to build an extension method that will allow me to subdivide a huge array into much smaller ones. My current code is the following but it still takes about 2s to generate with an array of size 512x512x512 and the size of the sub cubes set to 32x32x32 public static T[][][][] Divide<T>(t...

Wondering about efficiency here - I have a bit of code that does what I want; but it is terribly slow. I structured the code in a way that made sense to me logically, but I'm wondering if someone else could take a look at the code and find a shortcut or two that might make it faster. I'm guessing...

I made a multithreaded logger years ago when I was still a total newbie. It "worked" (when it didn't deadlock). Now that I'm slightly less newbie I'd like to get some criticism on this new version. The logger spawns an internal thread on its own method "writer", which purpose is writing to consol...

I was doing a TDD Kata (Greeter) and ended up with this code that I would like to get some feedback/review. Is there a good way to tell when it is okay to initialise an object inside a method body of a class and when it's better to pass it as a constructor dependency? For instance the kata was do...

I have a .net core console app that gets some data from an external API and inserts it into a SQL database table. It is working as expected but I wonder if you guys have any suggestions to make it more maintainable, testable, robust, and dynamic. By the way, I will add logging when getting data f...

I need help simplifying some ifs and else ifs. Is there a better solution to this? The code itself simply shows a couple of lines to the user, and depending on some conditions(whether a palisade is built, whether training grounds are built, and whether there is a stone wall) changes. Shortening t...

So despite my having about zero experience in Xcode, and iOS development, I was asked to try to update some config string in an Xcode project that was an app deployed to the iOS marketplace some time ago. In theory it all should just work, but of course it doesn't. When I build it complains about...

I try to solve a kata on codewars which let you write a skyscraper solver for skyscrapers up to size 11x11. You can read about skyscrapers puzzles here: To understand the problem it is good idea to solve some skyscrapers. My code for this works perfectly fine for all my test cases but there is th...

So I have a solution for this which uses a for loop and calculates distance between the main point and other points. I found the code for distance between two points online, changed it to my needs and wrote the rest of the code. While this code works pretty well, I'm just curious if there's a bet...

How can I decrease the time complexity and increase efficiency, without writing a new algorithm. My solution solves the majority of sudoku puzzles in a fast time, but for some difficult ones it can take over a minute! I have added some of the difficult puzzles below the code. import numpy as np f...

In option API (Vue 2 syntax which is still available in version 3) we could extract some repeated pieces inside many components and define them as mixin that could be reusable like : const colorable = { props: { bgColor: { type: String, default: "", },...

I have a very simple "database" (data.db) which is essentially a matrix like this: [,1] [,2] [,3] [,4] n01 "Avogadro number" "Na" "6.022140857e+23" "mol-1" n02 "Boltzmann constant" "kB" "1.38064852e-23" "J K-1" n03

Below is my code for the problem: ItoR = { 1: 'I', 4: 'IV', 5: 'V', 9: 'IX', 10: 'X', 40: 'XL', 50: 'L', 90: 'XC', 100: 'C', 400: 'CD', 500: 'D', 900: 'CM', 1000: 'M' } def convertItoR(number): number_str = str(number) number_len = len(number_str) rom_str = '' for i in range(nu...

A problem from Coderbyte. Find the longest word in a sentence after removing the punctuations and if two or more words are of same length return the first word Below is my solution: def cleanWord(word): # To remove punctuations punctuations = ['!','.','\'','"',',','&'] new_word = '' for ...

I have recently been in a situation where multiple developers worked on a shared local git repository under the same Linux user1. As one can imagine, it can easily become a bit annoying not to commit changes as someone else if you don't check the values of git config user.name and git config user...

https://leetcode.com/problems/sort-the-matrix-diagonally/ A matrix diagonal is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direction until reaching the matrix's end. For example, the matrix diagonal starting from ma...

I want to create a network in which the links are formed based on a similarity metric defined as the Euclidean distance between the nodes. The distance is calculated using socio-demographic features of customers such as gender and age. The problem is the code takes 200 seconds to just create the ...

I am trying to create a dictionary with a file containing text based on a matched pattern. Lines containing key_str should become keys and subsequent lines not matching key_str should become values and get associated with keys in the dictionary. so i have below code working: But I need help and g...