• Dec 9, 2025 •JordanWinston
0 likes • 2 views
• Jan 10, 2025 •alexandr.zaikin.9999-c10d
import os
• Apr 14, 2021 •Daedalus
0 likes • 0 views
Eqtt vw wvm awtdm ug xchhtm?
0 likes • 1 view
delivery.HTTP(publicMux, delivery.Service{ CalculateSaleEvent: usecase.NewCalculateSaleEvent(saleCalculator), TmEnrichMany: usecase.NewTmEnrichMany(saleCalculator), })
• May 13, 2025 •rejordon17-9956
fsfsdfsdfdsfsdf
• Mar 12, 2026 •prakhar.dev101-263b
class Solution { public: bool isGoodLength(int len, string& s) { } string longestPalindrome(string s) { int l = 1; // a string of length 1 can always be a pallindrome int r = s.length() + 1; // it is impossible to find a string of length s.length() + 1, leave alone pallindromic while(r > l + 1) { int mid = l + (r - l) / 2; if(isGoodLength(mid, s)) { l = mid; } else { r = mid; } } } };