注册一亩三分地论坛，查看更多干货！
您需要 登录 才可以下载或查看附件。没有帐号？注册账号 
x
求加米！！！
求加米！！！
求加米！！！
万年不换题 在心里默认白嫖 第一次见有白嫖onsite的公司 palo alto只有gotham组-gotham是做军事软件的 估计不招国际生 闲的
OA Typosquattng
Karat Phone
Onsite
挂
Onsite 题目
System Design (Decomp) : Course System Design
Learning: 内部用的query language 类似SQL
Coding: Contruct Quad Tree, Write TreeNode Class, Implement add, remove
大部分notes都是地里挖的 不是原创 先谢谢大佬们
Palantir Onsite
Opensource:
SWE principles include:
• Dedication: We see projects through from beginning to end in spite of obstacles we may encounter.
• Collaboration: We work internally with people from a variety of backgrounds — such as other Product Managers, Designers and Product Reliability Engineers. We also partners with our business development teams (Forward Deployed Engineers, Deployment Strategists) in order to understand and solve our customers' problems.
• Trust: We trust each other to effectively manage time and priorities, and don't micromanage. We want to give people the space to think for themselves.
Technologies We Use
write clean, effective code and learn new languages quickly.
Java and Go for back end and Typescript for front end
Open-source technologies like Cassandra, Spark, ElasticSearch, React, and Redux
Industry-standard build tooling, including Gr aladle, Webpack, and Github
What We Value
Familiarity with data structures, storage systems, cloud infrastructure, front-end frameworks
Strong coding skills with demonstrated proficiency in programming languages, such as Java, C++, Python, JavaScript,
Ability to collaborate and empathize with a variety of individuals. You can iterate with users and non-technical stakeholders and understand how your technical decisions impact them.
Demonstrated ability to learn and work independently and make decisions with minimal supervision.
System Design 1
Decomposition 2
Debug: 2
Coding: 2
CS fundamentals: 3
BQ: 3
Resume: 3
Might ask OA questions: 3
About Your Interviews
Your schedule will consist of three 60-minute interviews, touching on: writing code, software decomposition, and learning and using a new technical concept. Throughout the day you'll also be asked questions about your past work experiences or projects, what motivates you, and more. Be clear and detailed as to your interests and think deeply about what you want in your next role. Express what makes you curious, be enthusiastic, and show that you care about the work that you do. Don’t be shy about expressing your opinions on things that you have been working on. Be yourself!
CODING
What is this interview?
Coding questions test your ability to write code to solve a technical problem. They might require algorithms, data structures, or technical problem solving. The programming language is not important - code in whichever you feel most comfortable!
What makes an answer great?
It's great if you can demonstrate familiarity with a programming language. Pick the one that you are most comfortable with and practice writing some code before you come on site. Don't worry about memorizing every syntactic detail — we want to know how well you can implement, not how well you can memorize.
Map out your planned solution before you start to code. Step back and decompose the problem into smaller parts. Then design a solution at a high level, explaining to the interviewer what you plan to do. Then you can get to coding!
Share your thoughts throughout the problem, telling the interviewer about your assumptions, the options you're considering, relevant tradeoffs, potential edge cases, and your concerns.
Review your code by evaluating test cases and identifying what could go wrong with your solution.
DECOMPOSITION
What is this interview?
Decomposition, or decomp, questions test your ability to take an abstract or complex question and break it down — decompose it — into the pieces that make a practical solution. Decomp questions are usually open-ended, and there is not a right (or wrong) solution — it's more important to focus on how you break down the problem into smaller pieces and solve the smaller parts. During this interview, as you talk your way through the problem, you might find it helpful to have scratch paper or a dry erase board to organize your thoughts.
Why do we have this interview?
Palantir engineers often have to navigate ambiguous spaces to quickly deliver value. In fact, many decomposition questions are inspired by real problems our engineers have encountered on the job.
What makes an answer great?
We encourage you to talk through your implementation. State your assumptions, break down the problem, decide which path to pursue, and start getting into details.
Be sure to keep the whole problem in mind as you're working through it. All decomposition questions will contain multiple components, and navigating the end-to-end solution is key.
Ask questions of your interviewer! Clarify things that are not clear. Just know, they might not always give you concrete answers or strict requirements of the question; these questions are supposed to be s at Palantir (Palantir Explained, #2)Empowering governance teams to control and track access to data
Given a dependency tree, find a valid build path ( Post-order traversal ). Given a build path and dependency tree, verify if build path is valid.
Union find/ merge. the algo portion is basically Topological Sorting and Verification, and then a Union/ Merge.
第一个部分是白版写代码，写breadth first search，一个grid，都是数字0-5，水从5开始流向更小的数字，return 能不能流到0
Convert an integer into the word representation.
是面试官贴了一部分代码，上面有写好的类，函数prototype和一堆注释解释功能，然后让你根据这些实现一个函数，感觉不难，读懂了写就好了
BFS
DFS
Backtracking
Disjoint Sets / Union Find
CS fundamentals:
SQL:
Basic SQL understanding. Like what is foreign key, write a query to get some numbers in the table.
Sorting algorithms, consistent ordering/sorting, time/space complexity
QuadTree
BQ:
introduce Palantir service/video
demo是展示了他们给某个工厂基于他们的foundry平台做的一个支持很多键鼠拖拽和可视化效果的高级版google sheet的东西
问你why this company，你觉得符合你的价值观的公司还有哪些，你最想解决的世界性问题是什么（非要说出具体的问题，不能只说种类
Resume:
聊过去的project
Might ask OA questions:
See below
1.
Flood Map:
OA：Floodmap，三个部分，有点连贯，基本上可以用上个部分的代码帮助解下个部分。我是用了BFS做的，不是特别难，但是时间有点紧。
############################################################################
1.找high point， 比周围八个邻居都要大的点是highpoint
解法： 简单brute force
2. 注水后，求每个点有多少个水源能到达
解法：copy第一题的代码 对每个high point做BFS， 严格比上一个node小的点就将返回的矩阵对应位置+1
3. 求高原
解法 or 思路过程
a）看了地理面经我以为直接套用第一题思路，将 > 改成 >= 就可以了，但其实不是这样，高原的定义并不是只要周围所有邻居比它严格小，而是任何的high point都不能流水到这个高原上去
比如 [3,3,3,4] 里头， 如果直接用 >= 来做，那么高原情况就会是 [ 1,1, 0, 1 ]
但这河里吗？这不河里，[3,3]并不是高原，这样理解就会出错
b）那么既然如此，那我就先按照 >= 找到所有的高原点，并且对每个高原点去做BFS，如果邻居从我出发的高原点or上个遍历点要严格小，我就将这个高原点给置0
比如 [3,3,3,4]， 按照 >=找出高原情况后会是 [ 1, 1, 0, 1 ]，将所有的高原点加入stack -> [(0,0), (0,1), (0,3)]，对每一个进行BFS，为简便理解我们直接从(0,3)也就是4开始
4 可以流向 3，那么这个3在原来的高原情况要被置0，那么所有过程就是 [ 1,1,0,1 ] -> [1,1,0,1] -> [1,0,0,1] -> [0,0,0,1]
这样理解完题意，将其实现之后，提交，12/15 cases，提示TLE， 那么我们进一步优化
c）回头看前一步，有哪些多余的地方？多余在每个高原上的点都是相同的，比如 [3,3,3,4] -> [1,1,0,1]，在BFS的时候前面两个3我们遍历了两遍，如果原矩阵长成 [3,3,3,3,3,3,3,3.....,4] 那就完蛋了。
So， 在遍历进行BFS的时候，将跟当前起始点值相等，且在遍历队列中的点给移除，这样就去除了重复步骤，提交后15/15 test cases
将第三题的核心代码贴一下，肯定还可以更加简洁，但也提供个思路
############################################################################
2.
Typo-squatting:
10月底申请了palantir的forward deployed engineer，收到了typosquating version A 的 coding test。在hackerrank上面做，时间是60分钟，一共有三道题。感觉时间有点不够用，下面是我能回忆起来的考题：
task 1:
第一题typosquat是找company一样但是domain不同的网站，比如apple.com 是正确的，但是apple.org是错误的。
Task 2：
第二题是要找出用相似字母换掉正确网站中的字母的。比如leetcode.com 和leetc0de.com。题里给出了完整可以换掉的字母列表, 例如：il| 是一组 ，s5$ 是一组，a@是一组，o0是一组。
Task 3：
第三题是字母换了一个位置，例如palantir.com 和plaantir.com。只有相邻的字母换位置才算typosquat。如果换的位置大于1，则不算typosquat。palanti.rcom也算是typosquat.
每一个task都要能同时兼顾之前的task，比如task2必须能同时验出task1和task2的case，task3要验出task1，2，3的case。
新人发帖，请大家多多指教
3.
Sick Traveler
|
匿名用户-0XL2M
2021-11-19 07:44:25
狗仔卡
收藏
淘帖
好苗
杂草
提升卡
置顶卡
关贴卡
开贴卡
变色卡
千斤顶
