Application Support Analyst Interview Questions

5,435 application support analyst interview questions shared by candidates

What are your thoughts on the current mandates of the Risc-V ISA specification as it relates to enabling good, fast code for end users, compiler engineers, assembly performance optimization folks. How does that contrast with x86_64+AVX512, Armv9 with SVE etc. Follow up on discussion on where the rough edges of the existing Risc-V vector spec are
avatar

Staff Field Application Engineer

Interviewed at Tenstorrent

3.3
Jul 31, 2024

What are your thoughts on the current mandates of the Risc-V ISA specification as it relates to enabling good, fast code for end users, compiler engineers, assembly performance optimization folks. How does that contrast with x86_64+AVX512, Armv9 with SVE etc. Follow up on discussion on where the rough edges of the existing Risc-V vector spec are

Dungeon Adventure: You are given a 0-indexed 2D matrix dungeon of size m x n, where each cell (r, c) represents: - A wall if dungeon[r][c] = 0, or - A room with dungeon[r][c] treasure if dungeon[r][c] > 0. A hero can start from any treasure room (r, c) and can perform the following actions an unlimited number of times: - Collect all the treasure in the current room (r, c), or - Move to an adjacent room that contains treasure. Your task is to help the hero find the maximum treasure they can collect, starting from the best possible treasure room. If there are no treasure rooms in the dungeon, return 0. An adjacent room to (r, c) is defined as any of the following (if they exist): - (r, c + 1) (right) - (r, c - 1) (left) - (r + 1, c) (down) - (r - 1, c) (up)
avatar

Application-Engineer

Interviewed at Twilio

3.9
Dec 4, 2024

Dungeon Adventure: You are given a 0-indexed 2D matrix dungeon of size m x n, where each cell (r, c) represents: - A wall if dungeon[r][c] = 0, or - A room with dungeon[r][c] treasure if dungeon[r][c] > 0. A hero can start from any treasure room (r, c) and can perform the following actions an unlimited number of times: - Collect all the treasure in the current room (r, c), or - Move to an adjacent room that contains treasure. Your task is to help the hero find the maximum treasure they can collect, starting from the best possible treasure room. If there are no treasure rooms in the dungeon, return 0. An adjacent room to (r, c) is defined as any of the following (if they exist): - (r, c + 1) (right) - (r, c - 1) (left) - (r + 1, c) (down) - (r - 1, c) (up)

Viewing 1871 - 1880 interview questions

Glassdoor has 5,435 interview questions and reports from Application support analyst interviews. Prepare for your interview. Get hired. Love your job.