SoundHound Interview Guide

Showing 3 questions

Ranking

A question's ranking corresponds to how commonly it's asked by SoundHound. The higher the ranking, the more likely you'll encounter it in a SoundHound interview.

Question

Frequency

Difficulty

Check if Array Is Sorted and Rotated

Determine if a given array is sorted in non-decreasing order, but may have been rotated. In other words, check if rotating the array could result in a sorted array.

Arrays

Very likely

If you have a SoundHound interview, it's very likely that you will get this question

Easy

#1. Check if Array Is Sorted and Rotated

Easy

Determine if a given array is sorted in non-decreasing order, but may have been rotated. In other words, check if rotating the array could result in a sorted array.

Arrays

This question is very likely to be asked in your SoundHound interview

Linked List in Binary Tree

Determine if a linked list exists as a contiguous subpath within a binary tree. The subpath must follow the order of nodes in the linked list.

Linked ListsTreesRecursion

Somewhat likely

If you have a SoundHound interview, you might get this question

Medium

#2. Linked List in Binary Tree

Medium

Determine if a linked list exists as a contiguous subpath within a binary tree. The subpath must follow the order of nodes in the linked list.

Linked ListsTreesRecursion