Choose a Fortune 500 company to pitch Adobe's Firefly AI platform to, and explain how this tool can benefit that customer.
Associate Intern Interview Questions
1,281 associate intern interview questions shared by candidates
Projects that I mentioned in my resume
Why do you want to work for GetSales?
Why do you want to work at Trinity Life Sciences?
Medical condition: Severe Diabetic Edema Calculate the market size, first year profits and qualitative factors that would affect whether or not our new injectable drug would be effective.
Given an array of n positive integers, assuming 0-based indexing, its cost is the sum from i=1 to i=(len(arr) - 1) of (arr[i] - arr[i-1])^2. We want to find the minimum possible cost of the array after inserting exactly one element. For example, the cost of the array a = [1, 3, 5, 2, 10] before insertion is (1 - 3)^2 + (3 - 5)^2 + (5 - 2)^2 + (2 - 10)^2 = 81. After inserting 6 between 2 and 10, the cost of the array a is (1 - 3)^2 + (3 - 5)^2 + (5 - 2)^2 + (2 - 6)^2 + (6 - 10)^2 = 49. It can be proven that 49 is the minimum possible cost for the array a. Complete the function public static long getMinimumCost(List arr) to solve this problem.
Why fit for the role?
Tell me about when you faced a problem when working with a group, and how you overcame it.
Why do you think these features would improve the product?
In Today’s class, Chef is here to teach students about Trees. Tree is a a connected graph of N nodes and N-1 edges. After class, Chef gave them an assignment to complete. Assignment is as follows :- Given a tree with single node (root), we need to find whether we can build a tree with exactly N leaf nodes by applying given queries. Query 1 : Choose any i in between 2 to K and any leaf node say L in current Tree, attach i leaf nodes to L. (We can choose any particular i only once) Query 2 : Choose an existing edge of Tree and cut the edge. Remove the entire sub-tree attached with that edge. Students need to answer T independent test cases. Can you help them ? Example • If K = 5, N = 6. One possible way to build a tree with N = 6 leaf nodes is :- o Query 1:1 = 5, leaf node = root. Now, there are 6 nodes in tree and 5 leaf nodes. o Query 1 : 1 = 2, choose any of the 5 leaf nodes. Now, there are 8 nodes in tree an leaf nodes. • If K = 2, N = 3. It is not possible to build tree with 3 leaf nodes using given queries. Function Description •K: Represents the maximum value of i allowed in Query 1. •N: Represents the required number of leaf nodes.
Viewing 921 - 930 interview questions