2013 (section)
November 2013
-
▸
Python Dictionary Comprehension
Python dictionary comprehensions from Python 3 backported to 2.7. Shows conversion from list of lists, conditional key/value expressions, and performance comparison to loops.
October 2013
-
▸
Zen of Python by Tim Peters
The Zen of Python - Tim Peters' famous guiding principles for Python design. Displays all 19 aphorisms including 'Beautiful is better than ugly' and 'There should be one obvious way to do it'.
-
▸
File Upload with jQuery and Ajax
Upload files via jQuery AJAX using FormData object. Shows proper configuration with contentType and processData set to false for multipart form handling.
September 2013
-
▸
Installing the thefourtheyeEditor - topcoder plugin
Installation guide for thefourtheyeEditor, a lightweight TopCoder Arena plugin that enables external editor integration and stores solutions as local files organized by SRM.
-
▸
Ubuntu bug related to network and power
Fix for Ubuntu network connectivity issue when on battery power. ETH1 interface doesn't work on battery but works on AC power. Simple one-line fix via sysfs.
July 2013
-
▸
Compiling Node.js scripts in Windows 7 with Sublime Text 3
Configure Sublime Text 3 on Windows 7 to run Node.js scripts. Creates a custom JS.sublime-build file in the Application Data packages directory.
-
▸
Compiling C++11 Programs with Sublime Text 3
Configure Sublime Text 3 on Ubuntu to compile C++11 programs by creating a custom build file with -std=c++0x flag for g++.
June 2013
-
▸
SPOJ Best Solutions for The Double Helix
Celebrates the author's Python solution being featured in SPOJ's Top 20 for The Double Helix problem. A competitive programming milestone.
-
▸
Project Euler - 15 - Lattice paths
Project Euler Problem 15 - Lattice paths. Count routes through an NxN grid moving only right and down using dynamic programming. Solution builds from bottom-right corner.
-
▸
Project Euler - 14 - Longest Collatz sequence - memoization
Project Euler Problem 14 - Longest Collatz sequence. Demonstrates memoization to dramatically speed up computing chain lengths for the Collatz conjecture.
-
▸
Project Euler - Problem 5 - Smallest multiple
Project Euler Problem 5 - Smallest Multiple. Finds the smallest number divisible by all numbers 1-20. Compares brute force approach to optimized LCM-based solution using GCD.
-
▸
Project Euler - Problem 18, Problem 67 - Maximum path sum
Project Euler problems 18 and 67 - Maximum path sum. Classic DP problem: find the maximum sum from top to bottom of a triangular number pyramid by propagating maximums upward.
-
▸
Ubuntu 13.04 - Execute scripts on double click
Fix for Ubuntu 13.04 not executing scripts on double-click. Shows how to change Behavior settings in Files to either Ask each time or Run executable text files directly.
-
▸
gitclean - a git clean wrapper
gitclean is a safety wrapper around git clean that shows what files will be deleted and asks for confirmation before removing untracked files.
May 2013
-
▸
Sublime Configuring CodeIntel Auto Completion
Guide to install and configure SublimeCodeIntel for intelligent code completion in Sublime Text. Covers Package Control installation and per-language configuration.
-
▸
Ubuntu scaling the display (Zooming)
How to scale/zoom your display in Ubuntu using xrandr --scale option to get more screen real estate even with lower native resolution monitors.
-
▸
Google Code Jam 2013 - Round 1B - Osmos
Google Code Jam 2013 Round 1B Osmos problem solution. Uses greedy algorithm with the ability to grow (add to your size) or remove enemies to find minimum changes needed.
-
▸
Fixing Ubuntu apt-get sources
Bash script to fix Ubuntu apt-get sources.list by replacing it with mirror protocol URLs for faster and more reliable downloads. Works with any Ubuntu release.
-
▸
Python equivalent of C's freopen
Shows how to redirect stdin and stdout in Python to work with files, similar to C's freopen(). Enables automating interactive programs in competitive programming.
-
▸
Ubuntu Nvidia Driver Installation
Guide to install NVIDIA graphics drivers on Ubuntu. Covers installing kernel headers, driver packages, running nvidia-xconfig, and activating via Software Properties.
April 2013
-
▸
MongoDB Aggregation Framework Basics Explained
Introduction to MongoDB aggregation framework with SQL equivalents. Covers $match, $project, $group, $sort pipeline operators with examples comparing to SQL queries.
-
▸
Ubuntu Screen Configuration
Custom GNU Screen configuration for Ubuntu with status bar showing terminal numbers, hostname, date, and time. Includes .screenrc settings for keybindings and window management.
-
▸
PuttY style word selection in xfce4-terminal
Configure XFCE4 terminal to support Putty-style word selection on double-click. Shows the regex pattern to add in Advanced preferences: -A-Za-z0-9./?_~
-
▸
MongoDB Miscellaneous
Quick reference for MongoDB queries: date-based queries using ISODate, counting with length, finding distinct values, and sorting results with pymongo.
-
▸
Ubuntu Screen Custom Resolution
Explains how to add custom screen resolutions in Ubuntu using xrandr. Shows the --newmode, --addmode, and --output commands to set non-standard resolutions like 1600x900.
-
▸
SPOJ - ACODE - AlphaCode
SPOJ ACODE - AlphaCode. Counts possible decodings of a numeric string where 1=A, 2=B, ..., 26=Z using dynamic programming. Handles single and double digit interpretations.
-
▸
Timus - 1018 - Binary Apple Tree - Dynamic Programming
Timus problem 1018 - Binary Apple Tree. Uses dynamic programming to determine which branches to keep to maximize apples collected when only Q branches can be retained.
-
▸
UVa 11259 - Coin Changing Again
UVa 11259 - Coin Changing Again. Uses top-down dynamic programming with state encoding to find all possible ways to make change with limited coin counts. Includes solution with memoization.
-
▸
Number of ways to change making (Dynamic Programming)
A variant of the change making problem that counts the number of distinct ways to make change for a given amount using dynamic programming with coin denominations.
-
▸
Change Making (Dynamic Programming) Problem
Classic dynamic programming problem to find the minimum number of coins needed to make a given change. Uses a bottom-up approach with sorted denominations to compute optimal solution.
-
▸
Installing python-ldap in Ubuntu
Step-by-step guide to install python-ldap in Ubuntu. Details required packages: python-dev, libldap2-dev, and libsasl2-dev to resolve missing header file errors.
-
▸
Sponsor UVa Online Judge
A sponsorship campaign for UVa Online Judge, one of the oldest and most popular programming problem archives. Includes an embedded Indiegogo widget for donations.
-
▸
select2 JQuery dynamic JSON data with tags
Implements Select2 jQuery plugin with dynamic JSON data loading via AJAX and tag support. Shows configuration options for multiple selection, minimum input length, and custom formatting.
March 2013
-
▸
Check python package version in program
Shows how to check Python package versions at runtime using pkg_resources. Demonstrates getting both the full distribution object and just the version string.
-
▸
Deploying web.py application in Apache with mod_wsgi
Comprehensive guide to deploy web.py applications on Apache using mod_wsgi. Covers installing Apache, Python with shared libraries, mod_wsgi configuration, and common pitfalls.
-
▸
Installing python-ldap in cygwin
Installing python-ldap in Cygwin requires multiple dependencies. Details the installation process including the required libraries and common errors encountered during the build process.
-
▸
Installing node.js in Linux
Step-by-step guide to install Node.js from source on Linux (tested on RHEL 5.4 and Ubuntu 12.10). Covers wget, configure, make, and verifying installation with a simple HTTP server example.