Все публикации

#LeetCode 2996 |0:03:32

#LeetCode 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum #Java

#LeetCode 1280 |0:07:41

#LeetCode 1280 | Students and Examinations #SQL

#LeetCode 1356 |0:05:43

#LeetCode 1356 | Sort Integers by The Number of 1 Bits #Java

#LeetCode 2859 |0:05:21

#LeetCode 2859 | Sum of Values at Indices With K Set Bits #Java

#LeetCode 597 |0:05:24

#LeetCode 597 | Friend Requests I: Overall Acceptance Rate #SQL

#LeetCode 2485 |0:03:26

#LeetCode 2485 | Find the Pivot Integer #Java

#LeetCode 2595 |0:02:40

#LeetCode 2595 | Number of Even and Odd Bits #Java

#LeetCode 1135 |0:08:32

#LeetCode 1135 | Connecting Cities With Minimum Cost #Java

#LeetCode 2496 |0:04:45

#LeetCode 2496 | Maximum Value of a String in an Array #Java

#LeetCode 2643 |0:02:22

#LeetCode 2643 | Row With Maximum Ones #Java

#LeetCode 2119 |0:02:31

#LeetCode 2119 | A Number After a Double Reversal #Java

#LeetCode 2728 |0:02:18

#LeetCode 2728 | Count Houses in a Circular Street #Java

#LeetCode 2913 |0:03:36

#LeetCode 2913 | Subarrays Distinct Element Sum of Squares I #Java

#LeetCode 89 |0:06:15

#LeetCode 89 | Gray Code #Java

#LeetCode 2269 |0:03:45

#LeetCode 2269 | Find the K-Beauty of a Number #Java

#LeetCode 2164 |0:04:47

#LeetCode 2164 | Sort Even and Odd Indices Independently #Java

#LeetCode 2490 |0:06:41

#LeetCode 2490 | Circular Sentence #Java

#LeetCode 157 |0:05:48

#LeetCode 157 | Read N Characters Given Read4 #Java

#LeetCode 1640 |0:05:23

#LeetCode 1640 | Check Array Formation Through Concatenation #Java

#LeetCode 815 |0:15:26

#LeetCode 815 | Bus Routes #Java

#LeetCode 625 |0:05:49

#LeetCode 625 | Minimum Factorization #Java

#LeetCode 670 |0:07:19

#LeetCode 670 | Maximum Swap #Java

#LeetCode 696 |0:07:01

#LeetCode 696 | Count Binary Substrings #Java

#LeetCode 603 |0:02:55

#LeetCode 603 | Consecutive Available Seats #SQL