Dynamic Programming Interview Questions

**Education**: Tier-2 Institute **Experience**: 5.5 years **Previous Company**: FAANGMULA \# R1 - DSA Uncrossed Lines - [https://leetcode.com/problems/uncrossed-lines/description/](https://leetcode.co

Hi all, I have my Google Phone Screening interview for L4 next to next week Tuesday (4 march). What should i prepare? I did neetcode 150 recently. Now should I go ahead and do top 100 google tagged qu

Portfolio Value Optimization You have some securities available to buy that each has a price Pi. Your friend predicts for each security the stock price will be Si at some future date. But...

The 2-hour session includes separate timed sections for stats and coding. 13 simple multiple-choice stats probability questions. 4 multiple-choice time complexity questions. 3 coding questions, mostly

Current Status: New Grad 2023 Passout Education Qualification: Bachelor of Engineering Computers at a Tier 3 college Position: Software Engineer at Cisco ( Not sure of which level, haven\'t recieved the offer...

I was practicing coding problems online, and I initially wanted to use Q-squared, but couldn't figure it out in half a minute. The interviewer suggested using dynamic programming (DP), but I couldn't

Gave a OA of nutanix (IC4/5 role) List of question asked in 2 hour: 1) Maximum Quantity (Machines + maxPower) Given power[i] and quantity[i], pick a subset so that sum(power) <= maxPower and sum(quant

YOE: 4.5 Recruiter reached out on LinkedIn **Round 1: DSA (45 min)** Extremely Easy 1. Circular House Robber Made a modification to also find the indexes of the robbed houses. 2. 2D grid, min path sum

Got interview through referral. ## Qualifier Round: Analyze potential revenue for football (soccer) clubs based on their stadium capacity and historical performance. Use HTTP GET requests to access a

There are 3 questions in total, and I need to go to the company in person. Given an array like [1, 1, 1], I need to transform it into a specified array, where I can replace one element with the sum of

1. The first question is a simple string counting problem. The string type is "From To Count". It counts how many times "From" and "To" appear [unrelated to the count]. If "from" and "to" are the same

This post was last edited by Eric4 on 2025-10-01 23:35. There were three questions in total, mainly dynamic programming related, with a time limit of 80 minutes. Task 1: You are given a string letters

**Problem Statement** Data Engineers must schedule `n` long-running tasks on remote servers while minimizing total cost. There are two available servers: 1. **Paid Server:** Processing task `i` costs

**Problem Statement** The goal is to find the length of the longest subsequence in an array such that the bitwise XOR of any two adjacent elements in the subsequence equals a specific target value, $k

Problem Statement **Goal:** Minimize the number of "unhappy" students when assigning friend groups to a trip with a limited capacity. **Input:** 1. `groups`: An array of length $n$, where each eleme

**Recruitment Source:** LinkedIn Outreach **Total Duration:** Approximately 25 days **Outcome:** Selected **Online Assessment** * **Problem 1:** Basic algorithmic problem requiring loops and condition

**Round 1: DSA (Coin Change Variant)** **Problem:** Given a target integer $N$ and an array of coin sizes, determine the minimum number of coins required to sum exactly to $N$. If no combination resul

This article will give you information about the company, their recruitment process, sample questions that have been asked previously, lots of experiences shared by other ...

guys the tesla CEO just posted his interview experience. Apparently they asked him House Robber II og post: [https://www.linkedin.com/posts/fardeenkhimani\_tesla-ceo-just-submitted-his-interview-exper

Amadeus conducted an on-campus recruitment drive with multiple stages aimed at identifying candidates with strong technical and problem-solving skills. The process was wel...

LeetCode #53: Maximum Subarray. Difficulty: Medium. Topics: Array, Divide and Conquer, Dynamic Programming. Asked at Infosys in the last 6 months.

LeetCode #5: Longest Palindromic Substring. Difficulty: Medium. Topics: Two Pointers, String, Dynamic Programming. Asked at Infosys in the last 6 months.

LeetCode #300: Longest Increasing Subsequence. Difficulty: Medium. Topics: Array, Binary Search, Dynamic Programming. Asked at Infosys in the last 6 months.

LeetCode #121: Best Time to Buy and Sell Stock. Difficulty: Easy. Topics: Array, Dynamic Programming. Asked at Infosys in the last 6 months.

LeetCode #322: Coin Change. Difficulty: Medium. Topics: Array, Dynamic Programming, Breadth-First Search. Asked at Infosys in the last 6 months.