This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
mr_demo: = gitlab.MergeRequest { | |
BasicMergeRequest: gitlab.BasicMergeRequest { | |
ID: 370891163, | |
IID: 14, | |
TargetBranch: "main", | |
SourceBranch: "service-marketplace-product-2025-03-21T04-52-53Z", | |
ProjectID: 67898401, | |
Title: "Update values for marketplace/product - TkAo", | |
State: "opened", | |
Imported: false, |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import ( | |
"fmt" | |
"math/rand" | |
"os" | |
"os/signal" | |
"sync" | |
"syscall" | |
"time" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Leetcode daily challenge - 14.06.22 | |
// https://leetcode.com/problems/delete-operation-for-two-strings | |
// Top Down DP approach - O(n*m) space and O(n^2) time complexity | |
class Solution { | |
public: | |
int minDistance(string word1, string word2) { | |
int n = word1.size(),m = word2.size(); | |
int dp[n+1][m+1]; | |