Spotify Software Engineer Interview Questions

Kishor J. - "we can use two pointer + set like maintain i,j and also insert jth character to set like while set size is equal to our window j-i+1 then maximize our answer and increase jth pointer till last index"See full answer

Pathworks P. - "To answer this, I will focus my efforts on explaining the most common type of API used in most modern software development applications - the REST API. For the purpose of simplicity, I will also keep the topics of Authorization and Authentication out of the mix. In essence, an API is a group of logic that takes in a specific set of inputs and responds with a specific set of outputs. This is analogous to going to a drive-thru and placing an order for a meal. When you give an API a bunch of"See full answer

Anonymous Roadrunner - "def is_valid(s: str) -> bool: stack = [] closeToOpen = { ")" : "(", "]" : "[", "}" : "{" } for c in s: if c in closeToOpen: if stack and stack[-1] == closeToOpen[c]: stack.pop() else: return False else: stack.append(c) return True if not stack else False debug your code below print(is_valid("()[]")) `"See full answer

Tiago R. - "function hasCycle(head) { if (!head) return false; let slow = head; let fast = head.next; while (fast && fast.next && slow !== fast) { slow = slow.next; fast = fast.next.next; } return slow === fast; } `"See full answer

Basil A. - " public class Solution { // Definition for a binary tree node static class Node { String value; Node left; Node right; Node(String value) { this.value = value; this.left = null; this.right = null; } Node(String value, Node left, Node right) { this.value = value; this.left = left; this.right = right; } } static boolean balanced; public s"See full answer

Vaibhav D. - "Make current as root. 2 while current is not null, if p and q are less than current, go left. If p and q are greater than current, go right. else return current. return null"See full answer