201. | Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK | 6,619 | | Binaries
|
202. | Count Subarrays With Score Less Than K | Khandani Template Simple | Leetcode 2302 | codestorywithMIK | 6,588 | |
|
203. | Check if Number is a Sum of Powers of Three | Maths Proof | 3 Ways | Leetcode 1780 |codestorywithMIK | 6,574 | |
|
204. | Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK | 6,567 | |
|
205. | Partition Labels | 2 Clean Approaches | Leetcode 763 | codestorywithMIK | 6,561 | |
|
206. | Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK | 6,536 | |
|
207. | Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK | 6,517 | |
|
208. | Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK | 6,496 | |
|
209. | The Imperial Delhi | Weekend Getaway | Luxury Stay | 5 Star hotel | WeekendWithMik | 6,485 | |
|
210. | Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK | 6,473 | |
|
211. | Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK | 6,470 | | Brute Force
|
212. | Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK | 6,431 | |
|
213. | Construct String With Repeat Limit | 2 Simple Approaches | Leetcode 2182 | codestorywithMIK | 6,427 | |
|
214. | Sum of Prefix Scores of Strings | Trie | Full Easy Dry Run | Leetcode 2416 | codestorywithMIK | 6,416 | |
|
215. | Replace Words | Using HashSet | Uber | Leetcode 648 | codestorywithMIK | 6,318 | |
|
216. | Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK | 6,314 | |
|
217. | Count Largest Group | Simple Simulation | Dry Run | Leetcode 1399 | codestorywithMIK | 6,307 | |
|
218. | Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK | 6,298 | |
|
219. | Check if Array Is Sorted and Rotated | 3 Approaches | Leetcode 1752 | codestorywithMIK | 6,294 | |
|
220. | Minimum Obstacle Removal to Reach Corner I | Using Studied Concept | Leetcode 2290 |codestorywithMIK | 6,286 | |
|
221. | Number of Substrings Containing All Three Characters | Dry Runs | Leetcode 1358 | codestorywithMIK | 6,283 | |
|
222. | Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK | 6,247 | |
|
223. | Find Minimum Diameter After Merging Two Trees | Leetcode 3203 | Graph Concepts & Qns - 45 | MIK | 6,234 | |
|
224. | Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK | 6,230 | |
|
225. | Single Number III | Detailed Explanation | Leetcode 260 | codestorywithMIK | 6,222 | |
|
226. | Closest Prime Numbers in Range | 2 Detailed Approaches | Leetcode 2523 | codestorywithMIK | 6,211 | |
|
227. | Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK | 6,180 | |
|
228. | Count Prefix and Suffix Pairs I | Brute Force | Trie | Leetcode 3042 | codestorywithMIK | 6,123 | | Brute Force
|
229. | Number of Ways to Arrive at Destination | Straight Forward Simple | Leetcode 1976 | codestorywithMIK | 6,123 | |
|
230. | Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code | 6,107 | |
|
231. | Minimum Time to Visit a Cell In a Grid | Using Studied Concept | Leetcode 2577 | codestorywithMIK | 6,096 | |
|
232. | Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK | 6,094 | |
|
233. | Binary Search Tree to Greater Sum Tree | Brute | Better | Optimal | Leetcode 1038 | codestorywithMIK | 6,063 | |
|
234. | First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK | 6,047 | |
|
235. | Bitwise XOR of All Pairings | 2 Simple Approaches | Dry Runs | Leetcode 2425 | codestorywithMIK | 6,034 | |
|
236. | Find the Prefix Common Array of Two Arrays | 3 Detailed Approach | Leetcode 2657 | codestorywithMIK | 5,989 | |
|
237. | Reverse Odd Levels of Binary Tree | Detailed | DFS | BFS | Leetcode 2415 | codestorywithMIK | 5,988 | |
|
238. | Neighboring Bitwise XOR | 2 Detailed Approaches | Dry Runs | Leetcode 2683 | codestorywithMIK | 5,986 | | XOR
|
239. | Special Array With X Elements Greater Than or Equal X | 3 Approaches |Leetcode 1608|codestorywithMIK | 5,983 | |
|
240. | Making A Large Island | Brute Force | Better | Optimal | Dry Run | Leetcode 827 | codestorywithMIK | 5,929 | | Brute Force
|
241. | Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK | 5,923 | |
|
242. | My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK | 5,909 | |
|
243. | It’s Time | Go Get It | 5,900 | |
|
244. | Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK | 5,870 | |
|
245. | Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK | 5,856 | | Binaries
|
246. | Number Complement | Multiple Approaches | Leetcode 476 | codestorywithMIK | 5,856 | |
|
247. | Count the Number of Complete Components | Multiple Approaches | Leetcode 2685 | codestorywithMIK | 5,844 | |
|
248. | Count Symmetric Integers | 2 Detailed Approaches | Leetcode 2843 | codestorywithMIK | 5,831 | |
|
249. | Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525 | 5,828 | |
|
250. | Maximum Total Importance of Roads | Thought Process | Leetcode 2285 | codestorywithMIK | 5,824 | |
|
251. | Subarrays with K Different Integers | Approach-1 | With Reasons | Leetcode 992 | codestorywithMIK | 5,807 | |
|
252. | Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | codestorywithMIK | 5,803 | |
|
253. | Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK | 5,789 | |
|
254. | K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629 | 5,770 | |
|
255. | Relative Sort Array | Counting Sort | Using Lambda | Leetcode 1122 | codestorywithMIK | 5,760 | |
|
256. | But bhai…. | 5,744 | |
|
257. | Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK | 5,697 | |
|
258. | Length of Longest Subarray With at Most K Frequency | 2 Ways | Leetcode 2958 | codestorywithMIK | 5,677 | |
|
259. | Shortest Distance After Road Addition Queries I | Easy Explanation | Leetcode 3243 |codestorywithMIK | 5,661 | |
|
260. | Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK | 5,660 | |
|
261. | Get Equal Substrings Within Budget | Classic Sliding Window | Leetcode 1208 | codestorywithMIK | 5,658 | |
|
262. | Count Equal and Divisible Pairs in an Array | Brute Force | Optimal | Detailed Maths | Leetcode 2176 | 5,638 | | Brute Force
|
263. | Minimum Length of String After Operations | 2 Approaches |Intuition |Leetcode 3223 |codestorywithMIK | 5,629 | |
|
264. | Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK | 5,589 | |
|
265. | Where coding meets storytelling | MIK | 5,579 | |
|
266. | XOR Queries of a Subarray | Simple Explanation | Leetcode 1310 | codestorywithMIK | 5,578 | |
|
267. | Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK | 5,571 | |
|
268. | Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK | 5,570 | |
|
269. | Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK | 5,566 | |
|
270. | Intersection of Two Arrays II | 2 Approaches | Easy Explanations | Leetcode 350 | codestorywithMIK | 5,528 | |
|
271. | Binary Subarrays With Sum | 2 Approaches | Detailed Explanation | Leetcode 930 | 5,526 | |
|
272. | Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560 | 5,516 | |
|
273. | Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK | 5,490 | |
|
274. | Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK | 5,484 | |
|
275. | Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK | 5,483 | |
|
276. | Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK | 5,478 | |
|
277. | Debug by Day, Deadlift by Night | codestorywithMIK | 5,477 | |
|
278. | Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK | 5,475 | | Counter-Strike: Source
|
279. | Minimum Number of Operations to Sort a Binary Tree by Level | Leetcode 2471 | codestorywithMIK | 5,446 | |
|
280. | Find Elements in a Contaminated Binary Tree | BFS | DFS | Leetcode 1261 | codestorywithMIK | 5,428 | |
|
281. | Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK | 5,418 | |
|
282. | Rotate String | Something to learn | Leetcode 796 | codestorywithMIK | 5,354 | |
|
283. | Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK | 5,327 | |
|
284. | Smallest String Starting From Leaf | DFS | BFS | Google | Leetcode 988 | codestorywithMIK | 5,316 | |
|
285. | Minimum Number of Operations to Make Elements in Array Distinct | 2 Approaches | Leetcode 3396 | MIK | 5,308 | |
|
286. | Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK | 5,295 | |
|
287. | Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK | 5,280 | |
|
288. | Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK | 5,278 | |
|
289. | Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK | 5,236 | |
|
290. | Nasha hai bhai 🥹 | 5,216 | |
|
291. | Minimum String Length After Removing Substrings | 3 Approaches | Leetcode 2696 | codestorywithMIK | 5,210 | |
|
292. | Minimum Increment to Make Array Unique | Sorting | Counting Sort | Leetcode 945 | codestorywithMIK | 5,192 | |
|
293. | Longest Palindrome | 3 Easy Approaches | Leetcode 409 | codestorywithMIK | 5,165 | | Counter-Strike: Source
|
294. | Find Score of an Array After Marking All Elements | 2 Approaches | Leetcode 2593 | codestorywithMIK | 5,132 | |
|
295. | Greatest Common Divisor Traversal | Why Graph | Why DSU | Google | Leetcode 2709 | 5,127 | |
|
296. | Furthest Building You Can Reach | What is Lazy Greedy | Recursion | Memoization | Leetcode 1642 | 5,125 | |
|
297. | Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK | 5,104 | |
|
298. | Partition Array According to Given Pivot | Multiple Approaches | Leetcode 2161 | codestorywithMIK | 5,068 | |
|
299. | Achaaaaaa ☕️🧑🏻💻 | 5,060 | |
|
300. | Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK | 5,057 | |
|