Describe a past research/work technical challenge you have worked on
Learning Technology Interview Questions
2,887 learning technology interview questions shared by candidates
deep discussion on project, easy to schedule and professional. the interviewer was kind and patient, had a good experience
In ML fundamentals they asked to design a small LLM that could run on a phone while making sure its polite. In ML system design they asked to design a system to detected copyright violations on youtube
Algorithm questions packaged in a delivery scenario.
leetcode style coding questions (medium)
you better understanding about data structure and ML
A start-up owner is looking to meet new investors to get some funds for the company. Each investor has a tight schedule that the owner has to respect. Given the schedules of the days investors are available, determine how many meetings the owner can schedule. Note that the owner can only have one meeting per day. The schedules consist of two integer arrays: firstDay, and lastDay, aligned by index. Each element in the array firstDay represents the first day an investor is available, and each element in lastDay represents the last day an investor is available, both inclusive. Example: firstDay = [1,2,3,3,3] lastDay= [2,2,3,4,4] • There are 5 investors [I-0, 1-1, I-2, I-3, 1-4] • The investor I-0 is available from day 1 to day 2 inclusive [1, 2] • The investor I-1 is available in day 2 only [2, 2]. The investor 1-2 is available in day 3 only [3, 3] • The investors I-3 and I-4 are available from day 3 to day 4 only [3, 4] • The owner can only meet 4 investors out of 5: I-0 in day 1, 1-1 in day 2, 1-2 in day 3 and I-3 in day 4. Function Description Complete the function countMeetings in the editor below. countMeetings has the following parameters: int firstDayIn]: firstDaytil is the first day the ith investor is available to meet. int lastDayIn]: lastDayli] is the last day the ith investor is available to meet. Returns: int: the maximum number of meetings possible Constraints • 1 ≤ n ≤ 105 • 1 s firstDayli], lastDayli] ≤ 105 (where 0 ≤ i < n) • firstDayli] ≤ lastDayli] (where 0 ≤ i < n)
Did not make it this far - canceled before interivew. However the study materials sent to me by the recruiter included basic comp sci/SE data structures and algorithms, that I would need to code in a scripting language during the tech screen. The resources were great, very comprehensive, but so much that it would be best to pare down to the essentials. I learned a lot from looking up what other successful candidates had done for their prep. AlgoExpert was my favorite resource, along with books like Cracking the Coding Interview by Gayle Laakmann McDowell and some popular textbooks.
Most of the are DSA
System design question on genAI
Viewing 1861 - 1870 interview questions