#day3
Day: 07.03.2025
Problems:
1. Remove Element
2. Majority Element
3. Design HashSet
P.s) Bad yechimlar
Day: 07.03.2025
Problems:
1. Remove Element
2. Majority Element
3. Design HashSet
P.s) Bad yechimlar
👍2🔥2
Forwarded from Saocodes
I have failed Google coding interview today, let's save it here.
I applied to google jobs from careers page, and hr reached out to me. We had a call and he gave me a mock google interview. Mock interview was fine, got some positive feedback, but as usual couldn't solve the problem. Then a real assesment interview started and I failed from the first problem below:
I applied to google jobs from careers page, and hr reached out to me. We had a call and he gave me a mock google interview. Mock interview was fine, got some positive feedback, but as usual couldn't solve the problem. Then a real assesment interview started and I failed from the first problem below:
The problem:
input is a list of ranges
[[2,4],[4,5],[4,5]]
output - all possible numbers by concatinating numbers from ranges
244, 245, ..., 344
to be clear:
Input:
A list of ranges, where each range is represented as a 2-element array [start, end] (inclusive).
Example: [[2, 4], [4, 5], [4, 5]]
Output:
An array of strings. Each string represents a number formed by picking one digit from each range in the given order.
Example Output for above input:
["244", "245", "254", "255", "344", "345", "354", "355", "444", "445", "454", "455"]
The solution I wrote:
const findNumbers = (ranges) =>{
let rangeLength = ranges.length;
const buildCombination(arr, r, path){
let res = []
if(r === rangeLength){
res.push(path)
return res
}
for(let i=arr[0]; i<= arr[arr.length-1]; i++){
path = ${path}${i}
buildCombination(ranges[r+1], r+1, path)
}
}
return buildCombination(ranges[0], 0, '')
}
⚡1👍1🔥1
List of steps: 🚀
1) 42.uz & Grokking Algorithms Book
2) YouTube PlayList
3) AlgoExpert & SystemsExpert Videos & Algorithms Introduction
4) neetcode.io 250 & LeetCode 75
💻 GitHub
1) 42.uz & Grokking Algorithms Book
2) YouTube PlayList
3) AlgoExpert & SystemsExpert Videos & Algorithms Introduction
4) neetcode.io 250 & LeetCode 75
Please open Telegram to view this post
VIEW IN TELEGRAM
YouTube
Data structures playlist
Playlist of videos on data structures.
🔥4👍2⚡1
#easy 15.07.2025
p.s) Optimalroq yechimlar bo'lsa ulashing!
1) https://leetcode.com/problems/middle-of-the-linked-list
2) https://leetcode.com/problems/max-consecutive-ones
3) https://leetcode.com/problems/running-sum-of-1d-array/
4) https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/
5) https://leetcode.com/problems/fizz-buzz/
6) https://leetcode.com/problems/richest-customer-wealth/
p.s) Optimalroq yechimlar bo'lsa ulashing!
1) https://leetcode.com/problems/middle-of-the-linked-list
2) https://leetcode.com/problems/max-consecutive-ones
3) https://leetcode.com/problems/running-sum-of-1d-array/
4) https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/
5) https://leetcode.com/problems/fizz-buzz/
6) https://leetcode.com/problems/richest-customer-wealth/
⚡1👍1
Forwarded from Useful books | links
👍1🔥1
Forwarded from @Rustam-Z⚡️
🤔 Algoritmlarni Nimadan O'rganishni Boshlashni Bilmaganlar Uchun
Shu yerdan boshlanglar — https://neetcode.io/practice?tab=neetcode250. Hammasi bitta joyda.
Zo‘r resurs, zo‘r darslik topishda emas sir — balki nimadandir boshlashda, va ichingizda qiziqish yondirishda.
1 - 2 misol yechsangiz har kuni, 5 oyda tugatasiz. Har kuni 1 - 2 soatdan misollar yechishingiz kerak. Tugatasiz, va Google, Meta, Amazon, Yandex, ... kompaniyalarga ishga kirasiz, vako'p pul qilib , katta loyihalarda foydali experience olasiz.
Just be ready when you get your chance and don't miss it.
@cracking_maang
Shu yerdan boshlanglar — https://neetcode.io/practice?tab=neetcode250. Hammasi bitta joyda.
1 - 2 misol yechsangiz har kuni, 5 oyda tugatasiz. Har kuni 1 - 2 soatdan misollar yechishingiz kerak. Tugatasiz, va Google, Meta, Amazon, Yandex, ... kompaniyalarga ishga kirasiz, va
Just be ready when you get your chance and don't miss it.
@cracking_maang
👍3⚡1
Forwarded from @Rustam-Z⚡️
How to Approach Challenging LeetCode Medium-Level Problems?
When I started, I would spend 2 hours solving a single problem. That's okay.
While solving the problem, understand the question. If you get stuck, imagine helper functions or solve a simpler version by removing some constraints.
Article: https://rustam-z.notion.site/How-to-approach-solving-algorithmic-questions-if-you-stuck-2521ece53065800ca7ddf5c4020336a4
@cracking_maang
When I started, I would spend 2 hours solving a single problem. That's okay.
While solving the problem, understand the question. If you get stuck, imagine helper functions or solve a simpler version by removing some constraints.
Article: https://rustam-z.notion.site/How-to-approach-solving-algorithmic-questions-if-you-stuck-2521ece53065800ca7ddf5c4020336a4
@cracking_maang
⚡1👍1🔥1
SOME TIPS:
* https://www.youtube.com/watch?v=OMkfujDPpwc
* https://www.youtube.com/watch?v=XOtrOSatBoY
* https://www.youtube.com/watch?v=6ZZX9iIgFoo
* https://www.interviewcake.com/python-interview-questions
* https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed
* https://www.youtube.com/watch?v=OMkfujDPpwc
* https://www.youtube.com/watch?v=XOtrOSatBoY
* https://www.youtube.com/watch?v=6ZZX9iIgFoo
* https://www.interviewcake.com/python-interview-questions
* https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed
YouTube
How to: Prepare for a Google Engineering Interview
Watch our video to get the details of interviewing for our Engineering and Technical roles. Our engineers and recruiter have tips for being well-prepared for a Google interview. Learn more about how we hire at https://goo.gl/dUaWrU, then head over to htt…
⚡1👍1🔥1