Leetcode contest
565 subscribers
176 photos
7 videos
2 files
59 links
Main channel @azamovme

Leetcode & Messages quotes from Estate developer
Download Telegram
lets follow on github guys
shall we also participate geeks for geeks contest?
Anonymous Poll
63%
yes
11%
why not ?
26%
nah leetcode enough
Contest will back, do after two days
Today contest 🀩 #contest@leetcode7
Please open Telegram to view this post
VIEW IN TELEGRAM
#leetcode #contest-458 ✈️
Please open Telegram to view this post
VIEW IN TELEGRAM
πŸ‘8❀3
Leetcode contest
⚜ Sticker
This media is not supported in your browser
VIEW IN TELEGRAM
❀4πŸ‘2😁1
Forwarded from Azamov | Dev (Azamov)
Media is too big
VIEW IN TELEGRAM
While I managed to implement the core functionality and UI flow according to the provided mockups, with just one additional week. πŸ§ͺ I would have significantly improved both the structure and performance of the codebase.

Source | @azamovme thanks also for bytegroup_co πŸ’ƒ
Please open Telegram to view this post
VIEW IN TELEGRAM
πŸ•Š3
Should we start with daily questions as well, or is weekly enough?
Anonymous Poll
56%
GooπŸ₯‚
44%
Weekly enough
Alt season already started 🧒
Please open Telegram to view this post
VIEW IN TELEGRAM
Shoud we will do today contest or Tomorrow enough ? πŸ’¬
Please open Telegram to view this post
VIEW IN TELEGRAM
follow me on Github . we will start
Q1. Check Divisibility by Digit Sum and Product πŸ—―
Mode: Easy πŸ₯‚ @leetcode7 #leetcode #contest
Please open Telegram to view this post
VIEW IN TELEGRAM
Q2. Count Number of Trapezoids I ♾️
Mode: Medium (4pt) 🌴@leetcode7 @contest @leetcode #contest
Please open Telegram to view this post
VIEW IN TELEGRAM
Q3. Number of Integers With Popcount-Depth Equal to K II 🐸
Mode: Hard (6pt) πŸ‡
@leetcode7 #contest #leetcode @leetcode #contest-459
Please open Telegram to view this post
VIEW IN TELEGRAM
If need answers fastly dm me @saikou all is done 🫑
Please open Telegram to view this post
VIEW IN TELEGRAM
Leetcode contest
Q1. Check Divisibility by Digit Sum and Product πŸ—― Mode: Easy πŸ₯‚ @leetcode7 #leetcode #contest
🫡 Problem: Q1
βœ… Mode: Easy (5pt)
πŸ’‘ Code: Kotlin
class Solution {
fun checkDivisibility(n: Int): Boolean {
var sum = 0
var prod = 1
var x = n
while (x > 0) {
val d = x % 10
sum += d
prod *= d
x /= 10
}
return n % (sum + prod) == 0
}
}

@leetcode @leetcode7 @contest #weekly-459
Please open Telegram to view this post
VIEW IN TELEGRAM