| 201. | Jump Game IV - (Leetcode - 1345) - (Google, Microsoft, Adobe, Amazon) : Explanation β Live Coding | 59 | |
|
| 202. | Flatten Nested List Iterator | 3 Approaches | Full Details | GOOGLE | NETFLIX | Leetcode - 341 | 59 | |
|
| 203. | Reverse Linked List II | Clean | Simple Code | Dry Run | MICROSOFT | Leetcode - 92 | 59 | |
|
| 204. | Restore IP Addresses - (META) : Explanation β Live Coding | 58 | |
|
| 205. | Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91 | 58 | |
|
| 206. | Minimum Flips to Make a OR b Equal to c | 2 Approaches | Microsoft | Leetcode-1318 | Explanation | 58 | |
|
| 207. | Robot Collisions | Made Easy | Dry Run | Leetcode 2751 | codestorywithMIK | 58 | |
|
| 208. | Stone Game II | Game Strategy | EASIEST Explanation | META | Leetcode-1140 | Live Code | 58 | |
|
| 209. | Linked List in Binary Tree | Easy | Dry Run | Leetcode 1367 | codestorywithMIK | 58 | |
|
| 210. | Reverse Words in a String III | 2 Approaches | Zappos | MentorGraphics | Leetcode - 557 | Live Code | 58 | |
|
| 211. | Promise from a coder to coder πͺπ©π»βπ»π¨π»βπ» | 58 | |
|
| 212. | Find Largest Value in Each Tree Row | DFS | BFS | META | Leetcode - 515 | 57 | |
|
| 213. | Minimum Changes To Make Alternating Binary String | 2 Approaches | MICROSOFT | Leetcode 1758 | 57 | |
|
| 214. | Thank/Love You all 3000 β€οΈπ #coding #motivation #thankyou #subscribe #10000 #codestorywithMIK #code | 57 | |
|
| 215. | Max Points on a Line -(Google, Apple, LinkedIn, Amazon) : Explanation β Live Coding | 56 | |
|
| 216. | Most Stones Removed with Same Row or Column | Using DSU | DRY RUN | Leetcode 947 | codestorywithMIK | 56 | |
|
| 217. | Minimum Number of Operations to Make Array Empty | Explained with Reasons | Greedy | Leetcode 2870 | 56 | |
|
| 218. | Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750 | 56 | |
|
| 219. | Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525 | 56 | |
|
| 220. | Evaluate Division | With INTUITION | META, AMAZON | Leetcode-399 | Live Code π§π»βπ»π©π»βπ» | 56 | |
|
| 221. | Most Profit Assigning Work | Multiple Approaches | With Intuition | Leetcode 826 | codestorywithMIK | 56 | |
|
| 222. | Minimize Maximum of Array - (META) | Leetcode-2439 | Explanation β Live Coding π§π»βπ»π©π»βπ» | 55 | |
|
| 223. | Length of Longest Subarray With at Most K Frequency | 2 Ways | Leetcode 2958 | codestorywithMIK | 55 | |
|
| 224. | Shortest Bridge | Leetcode-934 | DFS + BFS | MICROSOFT | Explanation β Live Coding | 55 | |
|
| 225. | Monotonic Array | Simple | Clean | META | Leetcode - 896 | Live Coding | Explanation | 55 | |
|
| 226. | Lexicographically Minimum String After Removing Stars | Easy | Leetcode 3170 | codestorywithMIK | 55 | |
|
| 227. | Minimum Number of Arrows to Burst Balloons (Google, Facebook, Microsoft) : Explanation β Live Coding | 55 | |
|
| 228. | Number of Increasing Paths in a Grid | DFS + Memo | ADOBE, MICROSOFT | Leetcode-2328 | Live Code | 54 | |
|
| 229. | Number of Atoms | Made Easy | Full Dry Run | Leetcode 726 | Google | codestorywithMIK | 54 | |
|
| 230. | Poor Pigs | Maths | With Intuition | Clear Explanation | Leetcode - 458 | 54 | |
|
| 231. | All Ancestors of a Node in a Directed Acyclic Graph | 3 Approaches | Leetcode 2192 |codestorywithMIK | 53 | |
|
| 232. | Fraction Addition and Subtraction | Simple Simulation | Leetcode 592 | codestorywithMIK | 53 | |
|
| 233. | Longest Arithmetic Subsequence of Given Difference | Recur + Memo | Optimal | META | Leetcode-1218 | 53 | |
|
| 234. | Snapshot Array | Full Thought Process | Microsoft, Amazon | Leetcode-1146 | Live Code | 53 | |
|
| 235. | Maximum Product of Splitted Binary Tree -(Google, Meta, Amazon(Phone)) : Explanation β Live Coding | 53 | |
|
| 236. | Restore the Array From Adjacent Pairs | Easy Explanation | Dry Run | Intuition | Leetcode-1743 | 53 | |
|
| 237. | Find the Difference | 3 Approaches | Phone Interview | AMAZON | Leetcode - 389 | 53 | |
|
| 238. | Integer to English Words | Story To Code | Leetcode 273 | codestorywithMIK | 53 | |
|
| 239. | Custom Sort String | 2 Approaches | Intuition | Meta | Leetcode 791 | 53 | |
|
| 240. | Longest ZigZag Path in a Binary Tree - | Leetcode-1372 | MICROSOFT | Explanation + Live Code | 53 | |
|
| 241. | Diagonal Traverse II | 2 Approaches | Map | BFS | GOOGLE | Leetcode-1424 | 52 | |
|
| 242. | Group the People Given the Group Size They Belong To | Dry Run | LYFT | Leetcode - 1282 | 52 | |
|
| 243. | Minimum Remove to Make Valid Parentheses | 3 Detailed Approaches | Leetcode 1249 | codestorywithMIK | 52 | |
|
| 244. | Find Mode in Binary Search Tree | 2 Approaches | Follow Up | Leetcode-501 | GOOGLE | 52 | |
|
| 245. | Subarray Product Less Than K | Khandani Sliding Window template | Leetcode 713 | codestorywithMIK | 52 | |
|
| 246. | Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | 52 | |
|
| 247. | Find Beautiful Indices in the Given Array | Part I | Part II | Same Code | KMP | Weekly Contest 380 | 52 | |
|
| 248. | Detonate the Maximum Bombs | DFS | BFS | GOOGLE | Leetcode-2101 | Live Code + Explanation π§π»βπ» | 52 | |
|
| 249. | Merge Nodes in Between Zeros | 2 Approaches | Leap Of Faith | Leetcode 2181 | codestorywithMIK | 52 | |
|
| 250. | Scramble String - (GOOGLE) | Leetcode-87 | Explanation β Live Coding | 51 | |
|
| 251. | Distribute candies in a binary tree | Intuition | Story To Code | GfG POTD | 51 | |
|
| 252. | Create Binary Tree From Descriptions | Simplest Approach | Leetcode 2196 | codestorywithMIK | 51 | |
|
| 253. | Eliminate Maximum Number of Monsters | Intuition | GOOGLE | META | AMAZON | Leetcode - 1921 | 51 | |
|
| 254. | Remove Max Number Of Edges To Keep Graph Fully Traversable | Leetcode - 1579 | DSU | GOOGLE | Live | 51 | |
|
| 255. | Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385 | 51 | |
|
| 256. | Split Linked List in Parts | Clean | Simple Code | Dry Run | Amazon | Leetcode - 725 | 51 | |
|
| 257. | Construct String from Binary Tree | Amazon | Leetcode 606 | 51 | |
|
| 258. | Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463 | 50 | |
|
| 259. | Minimum Swaps to Group All 1's Together II | 2 Ways | Dry Runs | Leetcode 2134 | codestorywithMIK | 50 | |
|
| 260. | Build a Matrix With Conditions | BFS | DFS | Detailed Explanation | Leetcode 2392 | codestorywithMIK | 50 | |
|
| 261. | Convert 1D Array Into 2D Array | 2 Approaches | Leetcode 2022 | codestorywithMIK | 50 | |
|
| 262. | Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation β Live Coding | 50 | |
|
| 263. | Last Day Where You Can Still Cross | BFS | DFS | Binary Search | GOOGLE Onsite | Leetcode-1970 | 50 | |
|
| 264. | Longest Increasing Subsequence | Recursion & Memo |Tree Diagram |DP Concepts & Qns-11 | Leetcode-300 | 49 | |
|
| 265. | Delete Nodes From Linked List Present in Array | Simple | Dry Run | Leetcode 3217 | codestorywithMIK | 49 | |
|
| 266. | Insert Interval (Google, Twitter, Microsoft, Apple, Amazon) : Explanation β Live Coding | 49 | |
|
| 267. | Anti Diagonal Traversal of Matrix | Simplest Approach | GfG POTD | 49 | |
|
| 268. | Design a Food Rating System | Clean Approach | Leetcode-2353 | 49 | |
|
| 269. | Palindrome Partitioning - (Google, Microsoft, Meta) (Khaandani Template) : Explanation β Live Coding | 49 | |
|
| 270. | Successful Pairs of Spells and Potions - (MICROSOFT) | Leetcode-2003 | Explanation β Live Coding | 49 | |
|
| 271. | Unique Length-3 Palindromic Subsequences | 2 Ways | Intuition | META | GOOGLE | Leetcode-1930 | 49 | |
|
| 272. | Path Crossing | Leetcode 1496 | 49 | |
|
| 273. | Isomorphic Strings | Simple Thought Process | Leetcode 205| LinkedIn | codestorywithMIK | 49 | |
|
| 274. | Can Make Arithmetic Progression From Sequence | 2 Approaches | GOOGLE | Leetcode-1502 | 49 | |
|
| 275. | Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK | 49 | |
|
| 276. | Reduction Operations to Make the Array Elements Equal | Intuition | Leetcode-1887 | 49 | |
|
| 277. | Sort Array By Parity | 3 Approaches | Custom Comparator | META | Leetcode - 905 | 49 | |
|
| 278. | Number of Steps to Reduce a Number in Binary Representation to One | 2 Approaches | Leetcode 1404 | 48 | |
|
| 279. | Minimum Cost For Tickets - (GOOGLE) | Leetcode-983 | 2 Approaches | Explanation β Live Coding | 48 | |
|
| 280. | Median of Two Sorted Arrays | PART-1 | Brute Force | Better Approach | Google | Apple | Leetcode - 4 | 48 | |
|
| 281. | Number of Students Unable to Eat Lunch | 2 Approaches | Leetcode 1700 | codestorywithMIK | 48 | |
|
| 282. | Sort the Jumbled Numbers | 2 Approaches | Leetcode 2191 | codestorywithMIK | 48 | |
|
| 283. | Count Nodes Equal to Average of Subtree | 2 Approaches | Leetcode-2265 | Explanation β Live Coding | 48 | |
|
| 284. | Minimum Score of a Path Between Two Cities | Leetcode - 2492 | GOOGLE | Explanation β Live Coding | 48 | |
|
| 285. | Magic Squares In Grid | Simple Approach | Clean Code | Leetcode 840 | codestorywithMIK | 48 | |
|
| 286. | Minimum Deletions to Make Character Frequencies Unique | 2 Approaches | MICROSOFT | Leetcode - 1647 | 48 | |
|
| 287. | Total Cost to Hire K Workers | Using 2 Heap | Dry Run | META | Leetcode-2462 | Live Code | 47 | |
|
| 288. | Number of Good Pairs | 3 Approaches | META | Leetcode - 1512 | 47 | |
|
| 289. | Is Subsequence | With Follow Up Solved | 2 Approaches | AMAZON | Leetcode - 392 | 47 | |
|
| 290. | Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK | 47 | |
|
| 291. | Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK | 47 | |
|
| 292. | Checking Existence of Edge Length Limited Paths | Leetcode - 1697 | DSU | GOOGLE | Explanation | 47 | |
|
| 293. | Design HashMap | Brute Force | Optimal | META | GOOGLE | NETFLIX | Leetcode - 706 | 47 | |
|
| 294. | Determine if a Cell Is Reachable at a Given Time | Intuition | Math | Leetcode - 2849 | 47 | |
|
| 295. | Add Two Numbers II | Follow Up Qn Also | 2 Approaches | AMAZON | MICROSOFT | Leetcode-445 | 47 | |
|
| 296. | Task Scheduler | Easy Intuition | Using Heap | Leetcode 621 | codestorywithMIK | 47 | |
|
| 297. | Pascal's Triangle | Simplest Approach | Application | DRY RUN | Adobe | Amazon | Leetcode - 118 | 47 | |
|
| 298. | Remove Colored Pieces if Both Neighbors are the Same Color | Intuitive | GOOGLE | Leetcode - 2038 | 47 | |
|
| 299. | Reorder Routes to Make All Paths Lead to the City Zero | Leetcode - 1466 | META | DFS | Live Coding | 47 | |
|
| 300. | Optimal Partition of String - (AMAZON) | Leetcode-2405 | Explanation β Live Coding | 46 | |
|
