@greghogg5: Google Just Hit an Absolute Low - Easy Interview Question - Check if Sentence is Pangram - 1832 Crack big tech at algomap.io! #coding #leetcode #programming #interview
i guess they will not accept this answer cause it uses too much resources: it calculates hash for every character and uses a set when you could use just an array, iterate over the sentence to count all letters and then over the array to check that all the letters were used
2025-06-10 21:49:10
15
罗曼 :
no set needed to use array and counter
2025-06-10 15:55:09
40
David Gorobtchouk :
This would be a lot harder to actually implement anywhere. Its probably easier to manually check that every character is a character than to have an automated algorithm check if its a character based on the byte data
2025-06-10 17:26:12
5
كريمو :
People are just raging saying its not efficient , its a great solution and does the job thats it
2025-06-10 23:30:08
3
Jiachen Zhao :
How does that line confirm a sentence use every letter? Like this sentence is more than 26 char and doesn’t use every letter
2025-06-11 18:41:24
1
trex :
Doesn’t this solution ignore white soaces and punctuation?
2025-06-10 18:26:08
1
rayhan.mohammad1 :
what’s the time complexity of the solution
2025-06-10 15:50:45
0
Roy Segall :
And if ill pass 26 numbers?
2025-06-10 18:29:51
9
Muchemi :
what if the sentence has punctuation marks?🫴🏾
2025-06-10 23:37:47
0
gamerbro700788 :
The problem is that many inexperienced programmers will see, in EVERY problem, a complex problem, and will go immediately nuclear. So questions like this one are pretty good to apply some candidates filtering.
2025-06-11 03:14:32
16
poolstick :
am i the only one confused how has google hit an absolute low
2025-06-12 04:25:05
8
kitkotchunky :
Why do you always flame the companies asking these questions, only to come up with completely inefficient solutions? 😅😭
2025-06-10 20:24:10
5
.. :
eh, a lot of people get asked easy questions at all kinds of companies and just don’t tell the world about it.
2025-06-12 01:53:59
2
spaglia212 :
Let's use the most heavyweight answer you can think of. But that's par for the course these days.
2025-06-11 18:45:35
1
freyj1031 :
The stipulation that it consists of only lowercase English letters makes it WAY too easy
2025-06-11 12:46:59
1
Push Pull Commit :
If this was Go. I’d create a slice of ints length 26. And for every character subtract 'a' from it, that’s your index, increment the value there by 1 . After. Check if any 0s exist.
2025-06-29 14:30:40
0
j_vam_mater_turisticku :
AT LEAST
2025-06-29 23:10:17
0
BaldOldMan1455 :
dunking on google for no reason
2025-06-10 15:27:14
0
Isaac Newton :
in python just create a dictionary, loop over the sentence once, check length of keys
2025-07-31 01:09:31
0
F8y :
imagine failing a google interview because you forgot spaces exist
2025-06-11 22:59:28
0
Time To Wake up :
I hired 4 software engineers and I could care less about this test. But if they know how to code to scale a platform to serve 1,000,000 users in 10 seconds gets a job.
2025-06-11 15:37:23
0
B J :
Trying to use a nuke to hammer in a nail
2025-06-11 14:27:01
0
JohnDoe :
10/10 sol
2025-06-11 12:32:18
0
To see more videos from user @greghogg5, please go to the Tikwm
homepage.