I'm an elixir beginner. I'm doing the word count exercise of exercism website. The word count exercise returns a map with the word as the key and the number of instances as value. The exercise excludes special characters, and ignores underscores. My code works, but I'm sure there is a way to m...
A few weeks ago I recall a HackerNews story (found it again: "I Don't Want to Hire You If You Can't Reverse a Binary Tree") about reversing a binary tree (with, as I remember it, the end goal being to test for symmetry by testing the reverse for equality with the original).
I started hacking th...
I was asked a pretty basic question in a recent interview. Given a integer string , reverse the integers that are divisible by 3. Here is an example.
"1234567890" becomes "1204597863"
I was rejected with "poor code quality" as feedback. I would really appreciate reviews to improve my code below...
Looking for input, advice, criticism. This is my first help class. While use of mailto URLs should most often be trivial, I have a real world need to send to multiple recipients and with a body of text something more than just a one liner. Doing so gets sticky and there are some pitfalls with res...
I've created a project on Khan Academy as part of the Natural Simulations course on random walks.
This project is in JavaScript, using the Processing.JS library, slightly modified by Khan Academy.
(In the main, the inclusion of the Processing.JS library offers a few functions for drawing on a c...
Solution:
public class RemoveDuplicateInString {
public void removeDuplicate(String s){
System.out.println("Before::"+s);
int len = s.length();
for(int i=0;i<len-1;i++){
char c = s.charAt(i);
String preString = s.substring(0,i+1);
...
Problem Statement
In a School, Chocolate bars have to be distributed to children waiting in a queue. Each Chocolate bar is rectangular in shape. Consider its side lengths are integer values.
The distribution procedure is as follows:-
If bar is not square in shape, then the largest possible ...
#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
pthread_mutex_t count_mutex = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t condition_var = PTHREAD_COND_INITIALIZER;
void *function_count1();
void *function_count2();
int count = 1;
int main()
{
pthread_t thread1, thread2;
int r...
I have two views in my app and a bunch of buttons that show or hide them. I thought about using the sender.tag of the buttons that are passed to the function to hide or show the views:
@IBAction func showOrHideView(sender: AnyObject) {
UIView.animateWithDuration(0.5, animations: {
sw...
Whether based on MVar or TVar, async implementation are always based on operation on some underlying monad IO and STM.
Making Async a monad on its own i na naive way, as in F# async computation builder, require littering with unsafePerformIO which does not feel very haskellish.
module Async2(As...
This solution works, and I like having all the logic after the return.
Main purpose I wrote this function was for use with other functions to return file list:
outside <exclusion list>
grandparent directory in <inclusion list> and
base filename in <inclusion list>
So I end up using this + a...
In Rust, pointers can never be null, so in case where you actually need null, such as a linked list, you use the Option type:
struct element {
value: int,
next: Option<~element>,
}
How much overhead is involved in this (in terms of memory allocation and steps to dereference compared to...
I want to forward every mail with a specific subject to an e-mail. To the content of the original mail, a specific content ("geprüft") should be added.
I have the code now, but it doesn't work properly. It sends the last E-Mail clicked on :(.
Sub Test(oMail As MailItem) Dim MyItem As Outloo...
Many implementations of Sieve of Eratosthenes (used to find prime numbers up to a given n) use a temporary mutable array to keep track of which numbers are composites. I'm looking to write a purely functional version that has the same runtime complexity:
(define (primes-up-to n)
(cons 2 (unfol...
I am working on a Ruby gem to pull data from the Wikidata API. The data is deeply nested, as it contains a lot of repetition.
I have written a piece of Ruby (sans Rails) code that enables an array of hashes to be merged together, with any duplicate key-value pairs being stored as an Array under...
Main Calling from Web API :
public virtual async Task GetLookups(string types)
{
if (!String.IsNullOrEmpty(types))
{
var lookupTypes = types.Split(new char[] { ',' }, StringSplitOptions.RemoveEmptyEntries);
if (lookupTypes.Any())
{
...
