Daily Algo Boost | Challenge πŸ”₯
98 subscribers
50 photos
2 files
26 links
Sharpen your coding skills with daily LeetCode challenges and algorithm lessons.

(Solve leetcode problems every day)

#challenge πŸ”₯
Download Telegram
Forwarded from kamoloff.log
LeetCode VS Code extension

Man yoqtiradigan extensionlardan bittasi LeetCode.

U LeetCodedagi masalarni mani sevimli editorim VSCode da ishlash va submit qilish imkonini beradi.

Qulayliklari:
- O'zingizga qulay/tanish bo'lgan UI/theme
- Masalalarni qiyinlik darajasi, qaysidir tag yoki kompaniya bo'yicha filterlash mumkin.

Premiumsiz ham endi top kompaniyalarda eng ko'p so'raladigan masalalarni topishingiz mumkin.

Requirements:
- Node.js 10+

1. VSCode ni oching
2. Extensions dan LeetCode deb qidiring
3. Install
4. Extension orqali LeetCode accountingizga kiring

@kamoloff_log
πŸ‘4
Top Coding Interview Patterns

More πŸ‘ˆ

@algo_boost
πŸ‘2⚑1
HashMap haqida maqola yozdim

Uning ortidagi nazariya va zamonaviy dasturlash tillaridagi implementatsiyalari haqida batafsil o’qishingiz mumkin.

Link: https://asadullo.com/blog/hashing/

@solvemproblr
⚑1πŸ‘1
Ishni boshlashdan oldin qizib olish uchun yaxshi masala ekan.

Β© @techcodexs
Please open Telegram to view this post
VIEW IN TELEGRAM
πŸ‘5⚑1πŸ”₯1
#day1

Day: 05.03.2025

Problems:

1. Concatenation of Array

2. Contains Duplicate

3. Valid Anagram

O’z yechimingizni qoldiring πŸ‘‡
⚑2
#day2

Day: 06.03.2025

Problems:

1. Two Sum

2. Longest Common Prefix

3. Group Anagrams

p.s) Yanada optimalroq qilsa bular edi
πŸ‘2
#day3

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:



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
Please open Telegram to view this post
VIEW IN TELEGRAM
πŸ”₯4πŸ‘2⚑1