Code Review Weekly Newsletter
Code Review Weekly Newsletter

Top new questions this week:

DailyProgrammer 284: Wandering Fingers

Description Software like Swype and SwiftKey lets smartphone users enter text by dragging their finger over the on-screen keyboard, rather than tapping on each letter. You'll be ...

c# performance programming-challenge  
asked by px06 18 votes
answered by RobH 7 votes

Simple CodeReview Questions Notifications for OSX

Some days ago, I figured out that I'd like to get a notification every time a new question is asked here. So, I've made a really simple Python script, which uses pync (only OSX compatible) to do that ...

python python-3.x stackexchange macos  
asked by Dex' ter 11 votes
answered by Mathias Ettinger 8 votes

Sum two integers, unless they are the same, in which case return double their sum

I was doing a simple problem on codingbat and testing out my python. The problem was: Given two int values, return their sum. Unless the two values are the same, then return double their sum. ...

python comparative-review  
asked by Guest 9 votes
answered by Joe Wallis 20 votes

Building a minimal-height BST from a monotonically increasingly ordered array structure

Problem statement: Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height. Assumptions: The array (and ...

c++ algorithm tree c++14  
asked by erip 8 votes
answered by user2296177 5 votes

Password Validation in Python

I coded a python solution for the question below. I am after the fastest solution. Also, I would be grateful if you could point out parts that are not pythonic / inefficient. Question: A website ...

python performance  
asked by Zhubarb 7 votes
answered by Joe Wallis 8 votes

2D grid Hamiltonian path puzzle solver

The puzzle goes like this: in a rectangular 2D grid there are empty spaces (.), exactly one starting point (S, s) and obstacles (denoted below by X's). The objective of the puzzle is to find a path ...

python performance python-3.x pathfinding depth-first-search  
asked by shooqie 7 votes
answered by Gareth Rees 2 votes

Simple IRC Bot in C#

This was a simple IRC bot I threw together a long time ago, found recently, and was curious as to if there were any kind of significant improvements that could made. using System; using System.Net; ...

c# .net networking chat  
asked by T145 7 votes
answered by t3chb0t 8 votes

Greatest hits from previous weeks:

Grouping elements in array by multiple properties

During work, I was given this task: to group elements with similar properties in the array. In general, the problem is as follows: var list = [ {name: "1", lastname: "foo1", age: "16"}, ...

javascript sorting properties  
asked by Saike 22 votes
answered by konijn 25 votes

Implementing a linked list using C++

Any suggestions? #include<iostream> using namespace std; class node { friend class linked; private: int data; public: node ...

c++ beginner linked-list  
asked by shubham 3 votes
answered by Loki Astari 15 votes

Can you answer these?

A Version 4 UUID Implementation

I've been toying around with writing a decentralized, P2P application in REBOL 2, and one of the things I need to do is generate a universally unique identifier for users. I have written a function ...

random formatting rebol rebol2  
asked by Brian Otto 5 votes

Harry Potter's Family Tree Database

As an assignment for a class, I have made a small Harry Potter family tree in Prolog. It compiles into a self-contained executable that can be run straight from the command line on Linux machines. ...

beginner homework database prolog  
asked by Michael Brandon Morris 6 votes

Get n-th data member of a struct

To get n-th member of a struct without non-empty bases and w/o non-public members C++ now have a pretty way: #include <type_traits> #include <utility> #include <tuple> struct ...

c++ reflection c++17  
asked by Orient 2 votes
Subscribe to more Stack Exchange newsletters


Unsubscribe from this newsletter or change your email preferences by visiting your subscriptions page on stackexchange.com.

Questions? Comments? Let us know on our feedback site. If you no longer want to receive mail from Stack Exchange, unsubscribe from all stackexchange.com emails.

Stack Exchange, Inc. 110 William St, 28th Floor, NY NY 10038 <3