• Aug 17, 2025 •shekhar771
0 likes • 1 view
dzdzvcsd,v sd,.v, v,. ,.v , ,,vd,v dv
• Jan 10, 2025 •alexandr.zaikin.9999-c10d
0 likes • 2 views
import os
• 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; } } } };
• Oct 8, 2025 •opovolotskyi-7e4a
0 likes • 5 views
var obj = { prop: 1, getProp: function(){ return function () { console.log(this.prop); } }, };
• Aug 7, 2024 •naiferomar366-60ef
aaaa
• Aug 27, 2024 •vercetti322
0 likes • 6 views
#include <iostream> #include <vector> #include <algorithm> #include <cstdlib> #include <ctime> using namespace std; // Function to generate random numbers vector<int> generateRandomNumbers(int count, int minValue, int maxValue) { vector<int> numbers; for (int i = 0; i < count; ++i) { numbers.push_back(rand() % (maxValue - minValue + 1) + minValue); } return numbers; } // Function to print a vector of integers void printVector(const vector<int>& vec) { for (int num : vec) { cout << num << " "; } cout << endl; } // Function to sort and display numbers void sortAndDisplayNumbers(vector<int>& numbers) { sort(numbers.begin(), numbers.end()); cout << "Sorted numbers: "; printVector(numbers); } int main() { // Seed the random number generator srand(static_cast<unsigned int>(time(0))); int count, minValue, maxValue; cout << "Enter the number of random numbers to generate: "; cin >> count; cout << "Enter the minimum value: "; cin >> minValue; cout << "Enter the maximum value: "; cin >> maxValue; // Generate random numbers vector<int> numbers = generateRandomNumbers(count, minValue, maxValue); // Display unsorted numbers cout << "Unsorted numbers: "; printVector(numbers); // Sort and display sorted numbers sortAndDisplayNumbers(numbers); return 0; }