- 10
- 1 896
Code-X
India
Registrace 7. 11. 2021
You are most welcome on my channel Here I explained easy code of recent codeforces ,Leetcode ,Codechef Contest
Leetcode Weekly Contest 407 A to C Explained in details
Leetcode Weekly Contest 407
Number of Bit Changes to Make Two Integers Equal,
Vowels Game in a String,
Maximum Number of Operations to Move Ones to the End
Chapters
0:00 Problem A
8:55 Problem B
17:02 Problem C
Number of Bit Changes to Make Two Integers Equal,
Vowels Game in a String,
Maximum Number of Operations to Move Ones to the End
Chapters
0:00 Problem A
8:55 Problem B
17:02 Problem C
zhlédnutí: 77
Video
Codechef Starters 143 Division 3 (Rated) Explained in detail problem A, B, C
zhlédnutí 223Před měsícem
Codechef Starters 143 Division 3 (Rated) Explained in detail problem A, B, C Maximum Coins code - www.codechef.com/viewsolution/1072486399 Binary Conversion code - www.codechef.com/viewsolution/1072322362 Non-Divisor Array code - www.codechef.com/viewsolution/1072351434 chapter 0:00 Problem A 5:08 Problem B 20:33 Problem C
Codeforces Round (958) Div2 Problem A, B, C Explained in details
zhlédnutí 120Před měsícem
Codeforces Round 958 A, B, C Problem A, B, C Explained in details A : Split the Multiset B : Make Majority C : Increasing Sequence with Fixed OR Chapters 0:00 Problem A 7:14 Problem B 15:40 Problem C
Leetcode Weekly Contest 405
zhlédnutí 16Před 2 měsíci
Problem A,B,C Find the Encrypted String, Generate Binary Strings Without Adjacent Zeros, Count Submatrices With Equal Frequency of X and Y chapters : 0:00 Problem A 6:38 Problem B 15:25 Problem C
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2)
zhlédnutí 131Před 2 měsíci
EPIC Institute of Technology Round Summer 2024 (Div. 1 Div. 2), A. Upload More RAM, B. K-Sort, C. Basil's Garden chapters: 0:00 Problem A 4:16 Problem B 21:38 Problem C
Codeforces || Educational Codeforces Round 167 (Rated for Div. 2)
zhlédnutí 185Před 2 měsíci
Codeforces || Educational Codeforces Round 167 (Rated for Div. 2) Problem: 0:00 Problem A 8:50 Problem B 17:08 Problem C
LeetCode Contest Weekly Contest 403 A to C
zhlédnutí 129Před 2 měsíci
LeetCode Contest Weekly Contest 403 A to C
Codeforces Round 918 (Div 4) Simple and Easy Explained Logic in Hindi
zhlédnutí 21Před 8 měsíci
Codeforces Round 198 (Div 4) Chapters :- 0:00 Problem A 0:50 Problem B 2:42 Problem C 6:45 Problem D 22:34 Problem E
Codeforces Round 917 (Div 2) (A,B) Explained Logic in Hindi Problem A,B
zhlédnutí 524Před 8 měsíci
Codeforces, Round 917 (Div 2),Codeforces Round 917 (Div 2),Least Product,Erase First or Second Letter
Codeforces Pinely Round 3 (div1+ div2) Problem A and B Explained Logic in Hindi
zhlédnutí 470Před 8 měsíci
Codeforces, Pinely Round 3, Distinct Buttons,Make Almost Equal With Mod, Hindi,
for Problem B i made mistake correct statement is : number of zero of string s is equal to number of zero of string t and number of one of string s is equal to number of one of string t
helpful
waiting for this vai..
B se kio start koronga?a se kio nihi vai?
Because we looking for B as subsequnces and A as substring
kio ham b se check kore?agar a se check kore tab hoga keya?
Vai bohot assa explain kara. Love from Bangladesh. Please continue this type of video... How can i communicate with you?
bahut acha explanation hai keep going
java m kra bhai
So helpful
bhai ab hai hi nhi original me... kuch bhi
bro that was really good explanation!, keep up ur work! u are doing great!
DSA ke basic to advance problem solving ki ek playlist bhi bnaa do bhaiya
codeforces ya leetcode jo aapko acha lge
bhaiya please aap basic se ek video series start kijiye na problem solving ki , beginniner to advance problem solving usme aap hindi me aasaani se ek video bnaao jisme 1-2 basic questions with solution , youtuber per aapse acha explaination nhi he please bhaiya banaa do video series
problem b mei toh ab ban hee nhi rha
Problem B me hum tree banake sabko set me daalke set ka size bhi nikal sakte h?
Bohot complicated ho jayega maybe tle aa jaye if all substring banane baitho
But try kr sakte ho😊
will memory limit exists
Thanks !