Inspur 1st and 2nd

1st round with CEO:
-> domain knowledge: database indexing?, C++..., ...,
-> debug a small c program (can compile, but not receiving correct result)
-> coding: leetcode 4

2nd round with tech lead:
-> resume experience: very detailed, what was the schema of the database you created? why not build index on that column?
-> general c++ questions: String s = String("Hello") ? why c++ faster than java faster than python ? heap memory vs stack memory ? #define, #ifdefine ?
-> coding: "2-3-5-1+2*7" add as many as bracket pairs as you want, how many different outcomes can be achieved?

qhbCZPN 发表于 2022-11-9 17:11
想问下楼主当时是在linkedin上被hr联系的嘛？大概多久收到的面试呀

应该是在handshake投的简历，等了大约1-2个月

Coding求思路，没想出来

补充内容 (2022-06-22 00:21 +08:00):
Tech lead的coding

Dis0L 发表于 2022-6-21 11:21
Coding求思路，没想出来

补充内容 (2022-06-22 00:21 +08:00):

I didn't know either, but I'll guess an O(n**4) solution.
1. Keep a dp, let dp[i][j] = set of all possible outcomes from number i to number j
2. At any symbol index, first split the array into two parts. Use all outcomes from left part and all outcomes from right part to do final calculation.
If you have better solution, please advise

你面的是不是database development engineer

孙悟空908 发表于 2022-10-15 23:10
你面的是不是database development engineer

面的就是sde

TXLX 发表于 2022-10-18 14:04
面的就是sde

那你最后入职浪潮了吗

孙悟空908 发表于 2022-10-19 01:49
那你最后入职浪潮了吗

没有，又拿了几个别的offer，比完就没选他家

想问下楼主当时是在linkedin上被hr联系的嘛？大概多久收到的面试呀