TGViewer
Channel Public Channel
JavaHere's Blogs 🚀

JavaHere's Blogs 🚀

@javahereblogs

Youtube: youtube.com/@JavaIsHere
Linkedin: linkedin.com/in/javokhirakramjonov
Bored? @javohirakramblog
Contact: @javahere_admin
Open in Telegram
Subscribers
2.23K
Photos
248
Videos
5
Links
527

Showing posts older than #412 · Back to latest

Older Posts 20 shown
Post #410 339
✅✅✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: DFS

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N + M)

🗂 Xotira : O(N + M)

Bizni kuzatishda davom eting

Telegram | Youtube
  • ⚡ 1
  • 👍 1
Post #409 327
⚙️ ⚙️ ⚙️

Kun masalasi: 797. All Paths From Source to Target
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube
LeetCode All Paths From Source to Target - LeetCode Can you solve this real interview question? All Paths From Source to Target - Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any order. The graph is given as follows:…
  • 👍 2
  • 🎉 1
Post #407 310
⚙️ ⚙️ ⚙️

Kun masalasi: 1834. Single-Threaded CPU
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube
LeetCode Single-Threaded CPU - LeetCode Can you solve this real interview question? Single-Threaded CPU - You are given n tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] means that the i th task will be available to process…
Post #406 327
✅✅✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: Greedy

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O((N + M) · Log(N))

🗂 Xotira : O(N)

Bizni kuzatishda davom eting

Telegram | Youtube
  • 👍 2
Post #404 317
JavaHere's Blogs 🚀 ⚙️ ⚙️ ⚙️ Kun masalasi: 1962. Remove Stones to Minimize the Total Qiyinlik darajasi: O'rta Bizni kuzatishda davom eting Telegram | Youtube
🔔🔔🔔

Barchaga assalamu alaykum. Har kim "o'zining" yechimini jo'natishi mumkin. Har kuni yechim kutish ham aslida unchalik yaxshi ish emas. Siz ham harakat qiling.

To'g'risini aytganda hozir vaqt bo'lmayabdi kechroq albatta jo'nataman ammo ungacha kimdurning yechimini temporary qo'yib turardim va uning ustida bahs qilsa bo'ladi. Agar yechim yetarlicha optimal bo'lsa almashtirishga hojat yo'q.
  • 👍 4
  • 💯 1
Post #403 314
⚙️ ⚙️ ⚙️

Kun masalasi: 1962. Remove Stones to Minimize the Total
Qiyinlik darajasi: O'rta

Bizni kuzatishda davom eting

Telegram | Youtube
LeetCode Remove Stones to Minimize the Total - LeetCode Can you solve this real interview question? Remove Stones to Minimize the Total - You are given a 0-indexed integer array piles, where piles[i] represents the number of stones in the ith pile, and an integer k. You should apply the following operation exactly…
  • 👍 2
Post #401 355
✅✅✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: Math, Greedy

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N)

🗂 Xotira : O(1)

Bizni kuzatishda davom eting

Telegram | Youtube
  • 👍 2
Post #400 339
⚙️ ⚙️ ⚙️

Kun masalasi: 2279. Maximum Bags With Full Capacity of Rocks
Qiyinlik darajasi: O'rta

Bizni kuzatishda davom eting

Telegram | Youtube
LeetCode Maximum Bags With Full Capacity of Rocks - LeetCode Can you solve this real interview question? Maximum Bags With Full Capacity of Rocks - You have n bags numbered from 0 to n - 1. You are given two 0-indexed integer arrays capacity and rocks. The ith bag can hold a maximum of capacity[i] rocks and currently…
  • 👍 1
Post #394 374
🎞 🎞 🎞

Barchaga assalamu alaykum va hayrli tong. DFS va BFS mavzulariga oid kam bo'lsa ham masalalarni yechimlari va ularda DFS va BFS ni qanday ishlatish haqida videoyimiz tayyor bo'ldi. Manfaatli bo'ladi degan umiddaman. Savollar bo'lsa kommentariyalarda qoldirishingiz mumkin va in shaa Alloh albatta javob beraman. Do'stlaringizga ham ulashishni unutmang.

Bizni kuzatishda davom eting

Telegram | Youtube
YouTube Counting rooms | CSES #cses #algoritm_uz #dasturlash #javokhir_akramjonov Shiorimiz: Ertaga, Dushanbadan, Yanagi yildan, 18 kirsangiz emas, Bugundan boshlang. O'zbekcha kontentlar ko'payishiga va tarqalishiga hissa qo'shing. Obuna bo'lishni unutmang. Telegram: https://t.me/JavaHereBlogs…
  • 👍 3
  • 🔥 1
  • 🍾 1
Post #392 349
⚙️ ⚙️ ⚙️

Kun masalasi: 2389. Longest Subsequence With Limited Sum
Qiyinlik darajasi: Oson

Bizni kuzatishda davom eting

Telegram | Youtube
LeetCode Longest Subsequence With Limited Sum - LeetCode Can you solve this real interview question? Longest Subsequence With Limited Sum - You are given an integer array nums of length n, and an integer array queries of length m. Return an array answer of length m where answer[i] is the maximum size of a subsequence…
  • 👍 1
Post #391 441
  • 😢 1
Post #390 416
JavaHere's Blogs 🚀 ⚙️ ⚙️ ⚙️ Kun masalasi: 790. Domino and Tromino Tiling Qiyinlik darajasi: O'rta Bizni kuzatishda davom eting Telegram | Youtube
tg_image_1833885298.jpeg157.2 KB
✅✅✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: Dynamic Programming

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N)

🗂 Xotira : O(1)

Bizni kuzatishda davom eting

Telegram | Youtube
Older posts →
Threads Profile ViewerView any public Threads profile without an account.Open ThreadLook →Writing with AI? Make it sound human.Metric37 rewrites AI drafts so they read naturally. Free AI detector, 1,500 words free.Try Metric37 →