Meng Xuan Xia

  • Home

  • Archives

  • Tutoring

  • Projects

  • About

  • Tags

Tutorial: Hosting hexo subdirectory site on Netlify

Posted on 2019-04-17 | Comments:
Symbols count in article: 2.2k | Reading time ≈ 2 mins.

Netlify has been trending recently with its offerings of free static site hosting with CI-like continuous deployment and automatic https configuration. However Netlify [does not support deploying site to a subdirectory]. The workaround is to setup rewrite rules.

Read more »

Using gRPC in Production -- connection keepalive

Posted on 2019-02-23 | Comments:
Symbols count in article: 3.9k | Reading time ≈ 4 mins.

The gRPC quickstart guides do a very good job at helping the developers to get started using gRPC in their projects, but deployments to production is not discussed and available resources are sparse.

In this article we discuss a common deployment scenario and how to navigate around the pitfalls.

Read more »

On gender-neutrality of machine learning recruiting engines

Posted on 2018-10-11 | Comments:
Symbols count in article: 1.8k | Reading time ≈ 2 mins.

On October 8th, 2018, Reuters published an article about Amazon scraping secret AI recruiting tool which shows bias against women. This stories quickly trended on HackerNews and was pushed into the spotlight.

Read more »

Easy yet hard problem

Posted on 2018-09-23 | Comments:
Symbols count in article: 1.2k | Reading time ≈ 1 mins.

If you browse Kattis, one of the most common solved problem is this Easiest Problem. At a glance the problem is easy. Given a number $N$, find the smallest digit $p > 10$ such that the digits sum of $p \cdot N$ is equal to the digits sum of $N$: $dsum(N) = dsum(p \cdot N)$. For example, when $N = 4$, there is such $p = 28$ such that $dsum(4 * 28 = 112) = dsum(4)$.

On pen and paper this problem is almost too easy to solve, just try all such $p$ by brute-force suffices. Yet this problem contains a few challenges fundamental to understanding of programming.

First, one needs to be able to convert a string into integer in his or her favourite programming language, a question that is popular enough on StackOverflow. Then convert that integer into a sequence of digits. A naive way is to take each character of the string and turn them into individual digits. Another way is to take modulus 10 and continue with division by 10. One also needs to write loops or recursions in order to brute-force for an answer.

Then, one also needs to know how to read and write stdio from their favourite programming language, which might be non trivial for starters.

Numerically easy problem might not be programmatically easy after all.

Salary negotiation for young software engineers (and maybe other professions)

Posted on 2018-09-04 | Comments:
Symbols count in article: 3.3k | Reading time ≈ 3 mins.

You just finished university / coding bootcamp, and are now on the way to start your career as a software engineer. What should you do in order to get the highest salary that a company is willing to offer? After spending countless sessions on both sides of the interview table, here are a few tips that I wish the younger me knew back then.

Read more »
123…16

Meng Xuan Xia

Blog posts on math, computer science, software development and NLP.

78 posts
5 categories
82 tags
RSS
Github
© 2013 – 2022 Meng Xuan Xia | 225k | 3:25