Leetcode Weekly Contest 426 — Solution Discussion

Further discussions in Telegram and Discord:

In this video, we discuss the solutions of Leetcode Weekly Contest 426. The link to the problems:

0:00 Intro
4:47 Q1. Smallest Number With All Set Bits
7:26 Q2. Identify the Largest Outlier in an Array
25:40 Q3. Maximize the Number of Target Nodes After Connecting Trees I
46:42 Q4. Maximize the Number of Target Nodes After Connecting Trees II

#coding #leetcode #codeforces #programming #competitive_programming #learn_programming #learn_coding #code_tutorial #computer_science #computer_tutorial

[AlgorithmswithShayan]

You can join our Telegram channel using the link below:

[cursed_nerd]

you know Larry ?, he is the leetcode king imo

[DrOnZeR]

for first problem u can just count the number of bits and then do( 1<<no of bits )-1 .
int smallestNumber(int n) {
int num_bits=log2(n)+1;
return (1<<num_bits)-1;
}

[AvradipDas]

How to solve the higher constraint version of problem C? n, m <= 10^5