← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Level: Mid-Level
Round: Phone Screen · Type: Coding · Difficulty: 7/10 · Duration: 90 min · Interviewer: Unfriendly
Topics: Algorithms, Graphs, Permutations
Location: San Francisco, CA
Interview date: 2026-01-15
I had a 90-minute HackerRank technical phone screen with two coding questions.
The HackerRank round consisted of two questions that required optimization to pass all test cases.
Question 1: Given a permutation list and a value k, return true if, within the range of k, each value's corresponding permutation can be found as a subset in the permutation list; otherwise, return false.
Question 2: This question resembles a variation of LeetCode 1466.
Given a directed graph, select a root such that the number of reversed edges is minimized, ensuring all edges point away from the root.
LeetCode similar: LeetCode 1466