For my class I had an assignment to test the the benefits of a Move-To-Front Linked List vs. Just a standard Linked List. The assignment was meant to practice inheritance and pointers.
So the standard functionality is in the LinkedList class and then a MTFList class inherits that functionality an...
I have written a function that takes a specific number and a range that number cannot exceed, and converts it to a new numerical range.
/**
* @param int number The number to adjust.
* @param int oldMin The old minimum value.
* @param int oldMax The old maximum ...
See this method:
HRESULT CChristianLifeMinistryHtmlView::CustomContextMenu(const POINT* ppt, IUnknown* pcmdtReserved)
{
IOleWindow* oleWnd = nullptr;
HWND hwnd = nullptr;
HMENU hMainMenu = nullptr;
HMENU hPopupMenu = nullptr;
HRESULT hr = 0;
INT ...
I wnoder how can I refactor my code:
protected Map<String, Object> convert(Object entity) {
if (entity instanceof A) {
return convertToJSONMap(entity, APushDto.class);
} else if (entity instanceof B) {
return convertToJSONMap(entity, BPushDto.class);
...
I solve problems to prepare for interviews. Now I have written the algorithm of finding K largest numbers in array. Various solutions are described here: https://www.geeksforgeeks.org/k-largestor-smallest-elements-in-an-array/. Initially, I came up with the solution myself and looks my solution c...
One of the most exciting new functions in C++20 is std::format. I have never liked the ways that strings are formatted in C++ and have been guilty many times of using sprintf and such.
Since std::format is not implemented by any of the major compilers at this time, I fought I would try out my own...
Hello I have this method that returns an IEnumerable list , it takes 5 seconds to execute , so I want to know how can I optimize it side performance time of response.
private IEnumerable<dynamic> GetData(IEnumerable<dynamic> listD)
{
List<dynamic> data = new List<dynamic>();
foreach (var...
So the kata/problem was: "Simple, given a string of words, return the length of the shortest word(s)."
Example test: findShort("Bitcoin will maybe save the world")
And my solution was:
function findShort(s){
// convert string to array
const strArr = s.split(' ');
// loop throug...
x and y are two-dimensional arrays with dimensions (AxN) and (BxN), i.e. they have the same number of columns.
I need to get a matrix of Euclidean distances between each pair of rows from x and y.
I have already written four different methods that give equally good results. But the first thre...
Items.cs, Creates dictionaries, enumerators, and classes for every type of item.
using System;
using System.Collections.Generic;
public class Item {
// Medical
public static Dictionary < Medical, ItemMedical > Medicals = new Dictionary<Medical, ItemMedical>() {
{ Medical.bandage, new...
I have been writing this piece of code for a while now, and I was wondering, is it possible to run this code multiple times on my pc? For example could I make the code solve all the numbers from 1 to 1000 and all from 1001 to 2000 at the same time? And, if this is possible, could I use multiple c...
