All Questions
Tagged with dynamic-programming c#
24 questions
1
vote
1
answer
7k
views
Patch a JSON object using dynamic / ExpandoObject with System.Text.Json
Background
Recently, I was making some updates to an "older" library that would handle PATCH-style modifications to an object that is persisted in a JSON format on our document-storage ...
1
vote
2
answers
124
views
I want reduce the time complexity for this ladder problem to find the minimum ladders required
I was trying to attempt below given challenge. I tried multiple ways to solve the problem but none of them were good enough to pass the time limit. Please advise if you have any idea to improve on ...
3
votes
0
answers
314
views
LeetCode: Stone Game C#
https://leetcode.com/problems/stone-game/
Alex and Lee play a game with piles of stones. There are an even
number of piles arranged in a row, and each pile has a positive
integer number of stones ...
2
votes
2
answers
217
views
Knapsack performance issue
I'm solving a knapsack problem here. It works, but gives time limit exceeds on a certain test case.
Problem statement
There are N
items, numbered 1,2,…,N. For each i (1≤i≤N), Item i has a weight of ...
2
votes
1
answer
191
views
LeetCode: Trapping Rain Water DP C#
Please review for performance and C# style.
I already solved this question in 1 way.
LeetCode: trapping rain water C#
I tried also the dynamic programming approch
https://leetcode.com/problems/...
2
votes
2
answers
507
views
C# - Reapply the manipulation of JS Object in .Net Core
IMPORTANT:
I made another version with some improvements: Version 2
Since some months ago I disagree with the native/code methods to manipulate dynamic or ...
3
votes
2
answers
351
views
LeetCode: Shortest Common Supersequence C#
https://leetcode.com/problems/shortest-common-supersequence/
Given two strings str1 and str2, return the shortest string that has
both str1 and str2 as subsequences. If multiple answers exist, ...
7
votes
2
answers
391
views
LeetCode: Burst Balloons C#
https://leetcode.com/problems/burst-balloons/
Given n balloons, indexed from 0 to n-1, ...
4
votes
2
answers
315
views
LeetCode: House Robber III C#
https://leetcode.com/problems/house-robber-iii/
Please review for performance
The thief has found himself a new place for his thievery again. There
is only one entrance to this area, called the "...
5
votes
1
answer
153
views
Identify fraudulent bank transactions
Task: Return true if a transaction is allowed and return false if transaction is prohibited.
Details:
1. String is represented as an "array" that can contain up to three elements.
We need to ...
2
votes
3
answers
908
views
Leetcode #91 - Number of ways to decode a string
I'm working on problem 91 on Leetcode.com called Decode Ways and I've successfully managed to get a working recursive solution but it results in Time Limited ...
5
votes
1
answer
670
views
Longest Arithmetic Progression Algorithm
Problem Statement:
>
Given a sorted array, find the length of the longest arithmetic progression in it.
Examples:
numbers = new int[]{1, 3, 4, 5, 7, 8, 9}
The length is 5, and the sequence ...
3
votes
2
answers
175
views
Knapsack01 problem, written in c#
Is this code written in a decent style? Appreciate some feedback : )
...
5
votes
3
answers
3k
views
Maximum path sum in a triangle with prime number check
I was given this algorithm task:
You will have a triangle input below and you need to find the maximum sum of the numbers according to given rules below;
You will start from the top and move ...
2
votes
0
answers
3k
views
Hackerrank: Max Score
Problem statement
Consider an n-element sequence of integers, A = {a0, a0, ..., an-1}. We want to perform \$n\$ operations on \$A\$, where each operation is defined by the following sequence of ...