I have a dictionary with each item containing a quote in another dictionary: { ‘example1’: {‘quote’: ‘And it must follow, as the night the day, thou canst not then be false to any man.\n’}, ‘example2’: {‘quote’: ‘What a piece of work is man! how noble in reason!.\n’} } I need to completely remove each entry … Read more
I am using Java to parse a JSON file into a hash map so that i can search by typing a date and then get the cost, tax and profit for that date. So that if i write: 2001-09-18 13:11:01 I get: 7.14, 1.81 and 31.10 Here is part of the JSON file: { “stat”:[ … Read more
A related question got me thinking about a compact Braille dictionary. It certainly would be easier with Int16 or string but was going for most compact. I don’t think there is a case insensitive char so went with dual entries. Dictionary<char, byte> braile = new Dictionary<char, byte>() { { ‘a’, 0x20 }, { ‘b’, 0x30 … Read more
I have a code based on the following problem “Mapping phone numbers to names”, the problem is that when they are going to process large data(+100.000) the program ends by timeout. my code and problem is this, how can I optimize my code to consume less time? my code function processData(input) { var r=input.split(/\n/),o=Number(r[0]),c=r.length-1,x=[]; r.splice(0,o+1); … Read more
Consider I have a String: String value = “Sunday – H15,Sunday – H03,Sunday – H13,Sunday – H01,Sunday – H05,Friday – H23,Saturday – H05,Monday – H16,Monday – H17,Monday – H18,Monday – H19,Monday – H20”; In this String we have Days (Sunday, Monday etc..) and the alphanumeric (H15, H03 etc..) is hours. Now I want a JSON … Read more
After alot of reading and testing I’ve created a “half generic” hash table. What I mean by half generic is that the struct that I’m using have a name variable which is char * which is my key, and the second variable it contains is a pointer to void so it can be any struct. … Read more
I have a basic websocket server implemented in C++. I’m using Intel TBB’s concurrent hash_map to store all the users, uniquely identified by the id. The concurrent hash map will hold a key value pair of <int> and <std::set<string>> where the int is the user’s id, and the <std::set<string>> is a set of all instances … Read more
I’m attempting to implement a basic hash table in Python using linked lists. Any tips would be appreciated (including better hash functions). I intend this to handle collisions with separate chaining. I include my gist for my linked list: Question: Are there any things I handled incorrectly or could have implemented in a better way? … Read more
Let’s suppose that there’s a third part web service and I want to make a GET request to it and use the response to feed my project’s service. Next code will allow me to create a dict object only with non-falsy keys’ values: import requests from abc import ABC, abstractmethod class AbstractPayload(dict, ABC): def __new__(cls, … Read more
If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit. Example one: Input: [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = … Read more
