@greghogg5: This Apple Coding Question is Awesome! Leetcode 3019 - Number of Changing Keys Crack big tech at algomap.io! #coding #leetcode #programming #interview

Greg Hogg
Greg Hogg
Open In TikTok:
Region: CA
Friday 26 September 2025 15:03:55 GMT
62399
1295
59
26

Music

Download

Comments

myko101ab
Michael Barrowman :
Instead of .lower() you can use ord(c) % 40
2025-09-26 23:50:34
6
mohamma9191
Mo :
is that spouse to be hard ?
2025-09-26 16:26:49
186
rkulkarni93
rk :
There’s no way this is a real question
2025-09-26 16:49:57
122
madkah306
MadKah :
wouldn't it be better to make the whole thing lowercase once, and work with that? Now you're lowercasing each letter twice
2025-09-26 19:33:38
16
yotamzai
yotam :
in python its a one liner
2025-09-26 18:24:50
2
rikkertjonge
No :
I have a challenge too! Name a real world application for this scenario.
2025-09-26 23:27:12
20
tredegarironworks
Tredegar Iron Works :
Coding it is easy, but technically you need to know the language. Also, what’s a “character”? Is it a glyph, or a symbol? In German, is an ess-tsett one character or two?
2025-09-27 17:30:01
0
discountedsteak
discountedsteak :
Last used is not updated
2025-09-26 15:50:19
34
leemoretouchee
Lee More Touch ༽ :
If you haven't a lower or similar function you might create a mapping
2025-09-27 12:33:41
0
im_no_one881
im_no_one881 :
just use hash map for everything,
2025-09-26 19:26:45
2
icksie
X41 :
I thought there was gonna be some very optimised way to do it in c coming, not a basic python solution 😭
2025-09-27 22:50:19
0
maemiaqfollon
Amberto :
now in haskell
2025-09-27 00:09:00
0
andersrtoft
Anders Toft :
Your code is wrong and unoptimized. You don't update last_used and you have repeat lowering of the same values
2025-09-27 11:41:32
12
dep.trai.s1.tgioi
yêu em hao gầy :
I was expect a better solve that optimized time and space complexity than a single for loop
2025-09-26 16:48:05
1
tarkhna
TK :
this is so easy
2025-09-26 20:07:24
2
chrismottram590
chrismottram590 :
You need to validate the string is at least 2 chars long, then just loop looking to see if the char before the current loop pos char is different. No need to record last used char.
2025-09-28 11:29:49
0
ryanw911
Ryan :
The proper answer is to avoid that and question the entire philosophy of the function call in the first place then do nothing about it
2025-09-26 18:23:55
3
brangdonj
Brangdonj :
Unicorn support? Does f followed by fi ligature count as a change, or do you decompose the ligature?
2025-09-27 07:17:50
0
pimiento_burzz
Apple User727926140 :
you could also lowercase the entire string first
2025-09-28 00:30:30
0
awstechcloudnerd
awstechcloudnerd :
Apple’s asking this meanwhile one of my early interviews asked to code iterative merge sort from scratch.
2025-09-27 03:58:58
0
riccardoferra6
Riccardo Ferra :
I'm not sure: is there a trick to do it faster in a case like abBbBbBbBbBA?
2025-09-27 10:08:02
0
tracotrr
tracotr :
Yeah man they are not asking this for an interview
2025-09-26 15:32:37
16
shadarstan
Vay :
“Awesome coding question” and it’s literally just iterating through a string once 😭
2025-09-26 16:15:52
9
garbagefreeman4
garbagefreeman :
How is that awesome?
2025-11-15 23:33:13
0
strangegoodvibe
strangegoodvibe :
😁😁😁
2025-10-13 20:22:57
0
To see more videos from user @greghogg5, please go to the Tikwm homepage.

Other Videos


About