Ask HN: How can I help you?

1. Title inflation is a thing. I got my first CTO role in my late 20's and this was partially due to hopping on with a very early stage startup that needed tech direction/leadership/IC work. Getting exec roles in your younger years is much harder with larger more established companies.

2. Learn the whole stack. If you are the VPoE/CTO of a smaller company, people expect you to have the answers for everything tech. You pick the servers, infrastructure, code styles, architecture, frameworks, etc.

3. People are everything on a team. Before you are in one of these roles, spend some time understanding challenges people face in companies you work for, across departments. Grab lunches with people, talk to them about work. Some problems can be solved with an hour of coding a script for them. Most are more complicated, but developing this empathy and willingness to understand was crucial for me.

4. Being able to interview and hire well is an undervalued skillset in the tech industry. Involve yourself in those processes early to start understanding it. Remember that as CTO of a small/mid size company you may have final say on all tech hires as well as being the one who determines when positions are posted.

5. Grow comfortable with the unknown. There is a lot of on-the-job training for your first or second CTO run. Trust that you are smart and deserve where you are. You can figure this out.

The short answer is either:

1. Be willing to take a severe or entire pay cut at the start (i.e. Do it because you trust the person and believe the product and your equity will be worth it)

2. Know founders and investors and have a rich history of being a CTO / technical CEO with a plethora of launched apps to point at.

From my past life in automotive we had a huge nightmare certifying cars to have European E-call which runs on GPS AND the Russian equivalent that runs on GLONASS.

https://europa.eu/youreurope/citizens/travel/security-and-em...

https://en.m.wikipedia.org/wiki/GLONASS

It is harder to get funds from foreign clients, primarily because customers are wary of paying money to a russian company (because of hackers and scammers, i think). But you can solve it by registering a US company.

There is a "local market" trap: Russian market is obviously smaller than US one, but still large enough to be considered as a viable single option. That's why many russian companies go solely for the russian market, and that's why companies from Belarus or Ukraine (where local market is not large enough) are often focused on US/Europe from the start.

As for the recent events, I am not a fan, and hope that the situation resolves peacefully.

2) Why would you want to do that? You'd use bitmap index because it's quite compact and you can process the data at the speed of memory bandwidth, using ascii defeats that, no?

3) Not really. I just can't imagine costs of running any large website or app with serverless.

4) I think it's the same in the US - everyone competes for the same talent with FAANG (MAANG?). The salary gap between big companies and startups is even lower in Russia. Also, we humans want to do meaningful things, some of us struggle to find meaning in being another bigco employee.

5) Py

Volunteering

Open source

Teaching

Meetups

Also, TreeMap uses a red-black tree to implement the map, which is a basic type of binary tree. Depending on the data you’d like to store, other kinds of tree-based maps can have better performance characteristics. A map based on a Splay Tree[1] speeds up repeated accesses, so it could perform well if you had keys that were cheap to compute an ordering but expensive to compute a hash, and your access pattern has good temporal locality.

[1] https://en.wikipedia.org/wiki/Splay_tree

More nuance: - hashmap may be resized if it's over capacity, the resize may cause a latency spike.

- hashmap is essentially a single random memory access, tree is a couple of accesses but they are not random

- tree is a bit like a sorted array with fast inserts/deletes. Some trees, like leveldb, are in fact sorted arrays (plus some tricks, of course)

- if you use b-tree, you are more memory-efficient (but less cpu efficient), and access to nearby elements is almost free. That's why b-trees are used to store data in a permanent memory

- there are many other tree variants, each of them with different trade-off

Now whether the format of the post is acceptable to the kind of website HN is, I'm not quite sure, though I have seen submissions like these popping up more and more as of recently.