Forwarded from Azim Pulat
Sun'iy Intellekt Dasturchilarni Ishsiz Qoldiradimi?
Hozirgacha ChatGPTning kod yozish mahoratini ko'rgan bo'lsangiz kerak.
O'zidan so'rab ko'rsam, havotirga o'rin yo'q dedi. Ko'ngil xotirjamligi uchun, keling chuqurroq mulohaza qilamiz.
⏰ 24-dekabr, soat 19:00da
🎙️ @lazyprogrammer jonli suhbat
Hozirgacha ChatGPTning kod yozish mahoratini ko'rgan bo'lsangiz kerak.
O'zidan so'rab ko'rsam, havotirga o'rin yo'q dedi. Ko'ngil xotirjamligi uchun, keling chuqurroq mulohaza qilamiz.
⏰ 24-dekabr, soat 19:00da
🎙️ @lazyprogrammer jonli suhbat
Java C++ dan sekinroq ligi sababli keyingi videoda ulashmoqchi bo'lgan BFS va DFS tadbiqlari masalalari time limit ga tushib qolyabdi. Shuning uchun bu pollni uyishitirishga qaror qildim. Qaysi biridan foydalanamiz?
Anonymous Poll
41%
C++
48%
Java
11%
Farqi yo'q
😢1
Kun masalasi: 2389. Longest Subsequence With Limited Sum
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
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…
Return an array answer of length m where answer[i] is the maximum size of a subsequence…
👍1
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
Please open Telegram to view this post
VIEW IN TELEGRAM
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…
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
Kun masalasi: 55. Jump Game
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Jump Game - LeetCode
Can you solve this real interview question? Jump Game - You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can…
Return true if you can…
JavaHere's Blogs 🚀 pinned «#BFS #CSES #Graphs Monsters Bizni kuzatishda davom eting Telegram | Youtube»
Kun masalasi: 2279. Maximum Bags With Full Capacity of Rocks
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
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
#Leetcode #Daily
2279. Maximum Bags With Full Capacity of Rocks
Bizni kuzatishda davom eting
Telegram | Youtube
2279. Maximum Bags With Full Capacity of Rocks
Bizni kuzatishda davom eting
Telegram | Youtube
YouTube
2279. Maximum Bags With Full Capacity of Rocks | LeetCode
#leetcode #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://…
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://…
👍3🔥1
Kun masalasi: 1962. Remove Stones to Minimize the Total
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
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
JavaHere's Blogs 🚀
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.
Please open Telegram to view this post
VIEW IN TELEGRAM
👍4💯1
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
Please open Telegram to view this post
VIEW IN TELEGRAM
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…
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
Please open Telegram to view this post
VIEW IN TELEGRAM
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:…
The graph is given as follows:…
👍2🎉1