Ramp Software Engineer Platform SWE Online Test Experience
Question Details
This post was last edited by Anonymous on 2025-09-29 11:07. This is my third sharing this week. I'm asking for points to see my interview experience! This time, I applied for a Software Engineer/Platf
Full Details
This post was last edited by Anonymous on 2025-09-29 11:07. This is my third sharing this week. I'm asking for points to see my interview experience! This time, I applied for a Software Engineer/Platform position at the end of August and received an online assessment (OA) in mid-September. It was done on Coderbyte, with no time limit, a total of 30 minutes. The content included: 1 DSA coding question, 1 Git scripting question, and 3 multiple-choice questions (basic concepts). --- Q1. Coding Given a 2D 0/1 matrix (input as a string array), find the number of holes, i.e., connected 0 regions (connected in all four directions).
Example:
Input: ["10111", "10101", "11101", "11111"] Matrix: 1 0 1 1 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1 1 Output: 2. Use DFS/BFS to flood fill and count all zero regions. Refer to LC200. --- Q2. Git Script Write a simple bash script with the following requirements: clone repo -> create a new branch -> create a file in the branch -> finally print git status. Basically, just be familiar with Git commands: git clone, git checkout -b, echo ... > file, git status --- Q3. Multiple Choice (Three Concepts) What are the differences between DFS and BFS? What is the definition of a Git merge conflict? What is the function of git diff-tree -r {commit hash}? --- The overall difficulty is not high; 30 minutes is more than enough. However, I
passed all of them but didn't follow up. Additional content (2025-09-30 06:46 +08:00): I just realized that I accidentally tagged the wrong company when sharing the results of the ramp OA on the same day. Sorry QQ
About This Question
This is a reported interview question from a ramp interview for a swe role during the oa round reported in 2025.
It covers the following topics: Array, Strings, Bfs, Tree, Dfs, Graph, Arrays, Matrix .
Difficulty rating: Easy