#!process HRT reach out (interview)
muted ivy
get outplayed by a freshman gg im cooked
chrome cloud
freshman mfs leveling the playing field
quaint moss
whats ur prev?
Scale larp and BeReal
But bro is a grinder
No hate from me
I love midwestern grit
drowsy wasp
Scale larp and BeReal
I don’t larp 😢 I wear my hat proudly
quaint moss
I don’t larp 😢 I wear my hat proudly
Yh cooked
I feel bad for the people in your year
What role
drowsy wasp
Swe intern
Shi in c++ I heard
I’m delaying ts to narnia
They want interview next week
nova rose
vector<int> two_sum (vector<int> nums, int target) {
for (int i = 0; i < nums.size()-1; ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if (!(target - nums[i] + nums[j])) {
return {i, j};
}
}
}
return {-1, -1};
}```@drowsy wasp some free alpha for u gng
class Solution {
public:
bool isPalindrome(int x) {
if (x < 0 || (x % 10 == 0 && x != 0)) {
return false;
}
int reversedHalf = 0;
while (x > reversedHalf) {
reversedHalf = reversedHalf * 10 + x % 10;
x /= 10;
}
return x == reversedHalf || x == reversedHalf / 10;
}
};```#include <vector>
#include <string>
using namespace std;
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.empty()) return "";
string prefix = strs[0];
for (int i = 1; i < strs.size(); ++i) {
while (strs[i].find(prefix) != 0) {
prefix = prefix.substr(0, prefix.length() - 1);
if (prefix.empty()) return "";
}
}
return prefix;
}
};```fr
nova rose
these are what i got asked by desco, js, radix, headland, rentech and more
especially 2sum
vector<int> two_sum (vector<int> nums, int target) {
for (int i = 0; i < nums.size()-1; ++i) {
for (int j = i + 1; j < nums.size(); ++j) {
if (!(target - nums[i] + nums[j])) {
return {i, j};
}
}
}
return {-1, -1};
}```
i canNOT stress this solution enough@quaint moss
blissful sierra
Has HRT even opened 😭