/g/ - SAAAAAAARRRRRRRR GIVE ME $150K/YEAR JOB NOW SARRRR - Technology


08/21/20	New boards added: /vrpg/, /vmg/, /vst/ and /vm/
05/04/17	New trial board added: /bant/ - International/Random
10/04/16	New board for 4chan Pass users: /vip/ - Very Important Posts
[Hide] [Show All]

Anonymous
09/30/25(Tue)22:57:03 No.106753721

File: Untitled.png (160 KB, 485x863)

Anonymous 09/30/25(Tue)22:57:03 No.106753721

SAAAAAAARRRRRRRR GIVE ME $150K/YEAR JOB NOW SARRRRRRRR
SSSSAAAARRRR I DID THE LEETCODE SARRRR PLEASE GIVE ME A JOB SSAAARRRRR

Anonymous
09/30/25(Tue)23:02:56 No.106753757

Anonymous 09/30/25(Tue)23:02:56 No.106753757

>>106753721
I would say that about 85% of /g/ wouldn't even be able to solve this problem without looking at the solution.

Anonymous
09/30/25(Tue)23:18:29 No.106753865

Anonymous 09/30/25(Tue)23:18:29 No.106753865

>>106753721
>O(26 x N) = O(N)

Anonymous
09/30/25(Tue)23:22:15 No.106753898

Anonymous 09/30/25(Tue)23:22:15 No.106753898

>>106753757
i assume it's just an arbitrary length string of characters, and the objective is to find and replace the longest substring of repeating characters?
ezpz in O(n) in c.

Anonymous
09/30/25(Tue)23:23:29 No.106753913

Anonymous 09/30/25(Tue)23:23:29 No.106753913

>>106753721
Why not use regex

Anonymous
09/30/25(Tue)23:29:56 No.106753961

Anonymous 09/30/25(Tue)23:29:56 No.106753961

>>106753721
Not really related to your post but thanks for reminding me of Hacktober
This should be a fun month

Anonymous
09/30/25(Tue)23:31:41 No.106753973

Anonymous 09/30/25(Tue)23:31:41 No.106753973

>>106753865
that's correct

Anonymous
09/30/25(Tue)23:38:18 No.106754036

Anonymous 09/30/25(Tue)23:38:18 No.106754036

>>106753721
>wagecuck
>tags his post with neet
ICE, deport this jeet.

Name
Options
Comment
Verification	4chan Pass users can bypass this verification. [Learn More] [Login]
File
Please read the Rules and FAQ before posting. You may highlight syntax and preserve whitespace by using [code] tags.