Alteryx | DSA
Summary
I encountered these Data Structures and Algorithms questions during my interview process at Alteryx. The problems focused on finding specific subarrays and geometric calculations.
Full Experience
During my interview at Alteryx, I was presented with the following challenging Data Structures and Algorithms problems. The first question involved counting subarrays with a specific ratio of ones to zeros, which required careful array manipulation. The second problem was a geometry-based challenge, asking to count right-angled triangles formed by given coordinate points. I focused on detailing the problem statements as accurately as possible for future reference.
Interview Questions (2)
You are given a binary array nums and two positive integers x and y.
Your task is to count the number of contiguous subarrays of nums in which the number of 1s and 0s is in the exact ratio of x : y.
Definition
A subarray satisfies the ratio x : y if:count(1s) / count(0s) == x / y
Inputnums: an array of integers of length n (1 <= n <= 10^5), where each element is either 0 or 1.x: an integer (1 <= x <= 10)y: an integer (1 <= y <= 10)
Output
Return a single integer — the number of contiguous subarrays that satisfy the ratio condition x : y.
Given an array of xCordinates and yCordinates, get the count of right-angled triangles formed using those points.