2572. Count the Number of Square-Free Subsets (Leetcode Medium)

preview_player
Показать описание
Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!

#leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

This is a very difficult question after reading up on some of the other solutions for your python solution you can skip ones than at the end multiply your result by (2**ones)-1. After trying this though its still TLE

lostgoat
Автор

bro can you please do the explantion part a liitle more clearly because it is very difficult to understand you can refer takeuforward youtube channel he explains in a very good way can you please exaplain it better

utkarshpandey
Автор

I solved this question in 1 hr 38th min. Little bit slow🥲

Rohinth