DSA 37
- 1368. Minimum Cost to Make at Least One Valid Path in a Grid
- 2683. Neighboring Bitwise XOR
- 2425. Bitwise XOR of All Pairings
- 2429. Minimize XOR
- 2657. Find the Prefix Common Array of Two Arrays
- 3223. Minimum Length of String After Operations
- 2116. Check if a Parentheses String Can Be Valid
- 1400. Construct K Palindrome Strings
- 916. Word Subsets
- My Take on the KMP Algorithm
- 2185. Counting Words With a Given Prefix
- 3042. Count Prefix and Suffix Pairs I
- 1408. String Matching in an Array
- 1769. Min. No. of Operations to Move All Balls to Each Box
- 2381. Shifting Letters II
- 1930. Unique Length-3 Palindromic Subsequences
- 2270. Number of Ways to Split Array
- 2559. Count Vowel Strings in Ranges
- 1422. Maximum Score After Splitting a String
- 1639. Number of Ways to Form a Target String Given a Dictionary
- 689. Maximum Sum of 3 Non-Overlapping Subarrays
- 1004. Max Consecutive Ones III
- 1014. Best Sightseeing Pair
- 494. Target Sum
- 515. Find Largest Value in Each Tree Row
- 3203. Find Minimum Diameter after Merging Two Trees
- 2471. Min. No. of Operations to Sort a Binary Tree by Level
- 2940. Find Building Where Alice and Bob Can Meet
- 2872. Maximum Number of K-Divisible Components
- 2415. Reverse Odd Levels of Binary Tree
- 769. Max Chunks To Make Sorted
- 1475. Final Prices With a Special Discount in a Shop
- 2182. Construct String With Repeat Limit
- 3264. Final Array State After K Multiplication Operations I
- 1792. Maximum Average Pass Ratio
- 2762. Continuous Subarrays
- AVL Tree - Self Balancing Binary Search Tree