Search results for #everydayofcode
#everydayofcode Day 59✌️ Solved recursion-based Pow(x, n) problem dived into backtracking concept with call stack flow. Practiced string problems with the Valid Anagram using hashing & frequency count. Practiced bit manipulation Single Number problem using the XOR property.
#everydayofcode Day 59✌️ Solved recursion-based Pow(x, n) problem dived into backtracking concept with call stack flow. Practiced string problems with the Valid Anagram using hashing & frequency count. Practiced bit manipulation Single Number problem using the XOR property. https://t.co/rSbzqtJ7Lj
#everydayofcode Day 58 ✌️ Solved the Sudoku Solver problem on using the backtracking approach. Learned how to validate elements horizontally, vertically, and within sub-grids.
#everydayofcode Day 58 ✌️ Solved the Sudoku Solver problem on using the backtracking approach. Learned how to validate elements horizontally, vertically, and within sub-grids. https://t.co/iDFsXVPR8Z
#everydayofcode Day 57✌️ Practiced key array problems today—solved the Majority Element challenge using the Boyer-Moore voting algorithm and implemented the Array Subset check.
#everydayofcode Day 57✌️ Practiced key array problems today—solved the Majority Element challenge using the Boyer-Moore voting algorithm and implemented the Array Subset check. https://t.co/Cmvf0Fnm4J
#everydayofcode Day 56✌️ Understand concept through n queens problem... Horizontally, vertically and diagonally checking of n queens correct position.... enhanced backtracking concept
#everydayofcode Day 56✌️ Understand concept through n queens problem... Horizontally, vertically and diagonally checking of n queens correct position.... enhanced backtracking concept https://t.co/TJ72gCQTJi
#everydayofcode Day 55 Solved the Set Matrix Zeroes problem and learned how to update a 2D array in place. Practiced Kadane’s Algorithm to find the maximum subarray sum a
#everydayofcode Day 55 Solved the Set Matrix Zeroes problem and learned how to update a 2D array in place. Practiced Kadane’s Algorithm to find the maximum subarray sum a https://t.co/tLRoWFFWh7
#everydayofcode Day 54✌️ Solved the Permutations problem on LeetCode and deepened my understanding of recursion and backtracking. Learned how to generate all permutations by swapping elements in-place, avoiding any extra arrays and optimizing space usage.
#everydayofcode Day 54✌️ Solved the Permutations problem on LeetCode and deepened my understanding of recursion and backtracking. Learned how to generate all permutations by swapping elements in-place, avoiding any extra arrays and optimizing space usage. https://t.co/H4A1wQDPPy
#everydayofcode Day 53 ✌️ Solved two subset problems—one with unique elements and another allowing duplicates. Implemented backtracking to generate all possible subsets efficiently. Learned how to handle duplicate elements by sorting and skipping repeats.
#everydayofcode Day 53 ✌️ Solved two subset problems—one with unique elements and another allowing duplicates. Implemented backtracking to generate all possible subsets efficiently. Learned how to handle duplicate elements by sorting and skipping repeats. https://t.co/82PT4soEzK
#everydayofcode Day 52✌️ Dived into backtracking concept and solved subset problem and how call stack work . Practised binary search through minimum in rotated sorted problem...
#everydayofcode Day 52✌️ Dived into backtracking concept and solved subset problem and how call stack work . Practised binary search through minimum in rotated sorted problem... https://t.co/GGZ50oommF
#everydayofcode Day 51 Find Row with Maximum 1s – strengthened my understanding of 2D arrays. First & Last Occurrence – improved binary search skills. Palindrome String – practiced two-pointer logic.
#everydayofcode Day 51 Find Row with Maximum 1s – strengthened my understanding of 2D arrays. First & Last Occurrence – improved binary search skills. Palindrome String – practiced two-pointer logic. https://t.co/zSEHWu4weN
#everydayofcode Day 50 Practiced key bit-manipulation concepts today. Solved the count set bits problem using bitwise operations for an O(log n) solution. Implemented number swapping with bitwise XOR, eliminating the need for a temporary variable.
#everydayofcode Day 50 Practiced key bit-manipulation concepts today. Solved the count set bits problem using bitwise operations for an O(log n) solution. Implemented number swapping with bitwise XOR, eliminating the need for a temporary variable. https://t.co/bv9hFKUnY5
#everydayofcode Day 49 Solved the Nth root of a number using the binary search on answer technique. Understood how to efficiently find the root when it may not be an integer. implemented the classic Binary Search problem using a recursive approach for practice.
#everydayofcode Day 49 Solved the Nth root of a number using the binary search on answer technique. Understood how to efficiently find the root when it may not be an integer. implemented the classic Binary Search problem using a recursive approach for practice. https://t.co/UqHuMFczE3
#everydayofcode Day 48 Practiced bit manipulation: check if a bit is set, test power of 2, and count flips to convert number. Started recursion with Fibonacci sum to learn call-stack flow and subproblem breakdown.
#everydayofcode Day 48 Practiced bit manipulation: check if a bit is set, test power of 2, and count flips to convert number. Started recursion with Fibonacci sum to learn call-stack flow and subproblem breakdown. https://t.co/yM4qN8ZDam
#everydayofcode Day 47 Solved the Longest Common Prefix problem, strengthening my understanding of string manipulation. Explored recursion through factorial and summation programs. Gained deeper insight into how the call stack works during recursive calls.
#everydayofcode Day 47 Solved the Longest Common Prefix problem, strengthening my understanding of string manipulation. Explored recursion through factorial and summation programs. Gained deeper insight into how the call stack works during recursive calls. https://t.co/ZEUAG1Ni3q
#everydayofcode Day 46 Subarray Sum Equals K problem using the prefix-sum with hash map approach for optimal Longest Substring Without Repeating Characters problem using the sliding-window + unordered_set technique for efficient string handling. And progress Js in web dev ..
#everydayofcode Day 46 Subarray Sum Equals K problem using the prefix-sum with hash map approach for optimal Longest Substring Without Repeating Characters problem using the sliding-window + unordered_set technique for efficient string handling. And progress Js in web dev .. https://t.co/TonKjNsOTu
#everydayofcode Day 45 ✌️ Solved Search Insert Position and First & Last Position in Array problems, applying and sharpening my binary search skills. Also cracked the Two-Sum challenge using an unordered map for an optimal O(n) solution.
#everydayofcode Day 45 ✌️ Solved Search Insert Position and First & Last Position in Array problems, applying and sharpening my binary search skills. Also cracked the Two-Sum challenge using an unordered map for an optimal O(n) solution. https://t.co/aKmJcripwR
#everydayofcode Day 44✌️ Solved Largest Odd Number in String string scan and substring handling. Solved Union of Two Sorted Arrays two-pointer merge skipping duplicates. Solved Subarray Sum Equals K brute-force with prefix sums.
#everydayofcode Day 44✌️ Solved Largest Odd Number in String string scan and substring handling. Solved Union of Two Sorted Arrays two-pointer merge skipping duplicates. Solved Subarray Sum Equals K brute-force with prefix sums. https://t.co/bw2fM12zWm
#everydayofcode Day 43 Solved Longest Common Prefix, Rotate String, and Smallest Positive Missing problems. Practiced key string operations like prefix checking and circular rotation. Improved understanding of array indexing and in-place swapping.
#everydayofcode Day 43 Solved Longest Common Prefix, Rotate String, and Smallest Positive Missing problems. Practiced key string operations like prefix checking and circular rotation. Improved understanding of array indexing and in-place swapping. https://t.co/NZpzUWl9vF
#everydayofcode Day 42 ✌️ Solved the 4-Sum problem using sorting + two-pointer technique for an O(n³) optimal approach. And solved the Array Leaders problem with a right-to-left scan and running max tracking in O(n).
#everydayofcode Day 42 ✌️ Solved the 4-Sum problem using sorting + two-pointer technique for an O(n³) optimal approach. And solved the Array Leaders problem with a right-to-left scan and running max tracking in O(n). https://t.co/YmlMEcKVTa
#everydayofcode Day 41 ✌️ Solved the 3-Sum problem in two ways First used a hashing + set method to handle duplicates and understand the brute-force logic. Then moved to the two-pointer optimal approach after sorting for O(n²) time.
#everydayofcode Day 41 ✌️ Solved the 3-Sum problem in two ways First used a hashing + set method to handle duplicates and understand the brute-force logic. Then moved to the two-pointer optimal approach after sorting for O(n²) time. https://t.co/U6NLgt8E0e
#everydayofcode Day 40 ✌️ Solved Find the Duplicate Number using optimal slow–fast pointer method. Tackled 3-Sum with a brute-force approach. Used set to handle duplicate triplets.
#everydayofcode Day 40 ✌️ Solved Find the Duplicate Number using optimal slow–fast pointer method. Tackled 3-Sum with a brute-force approach. Used set to handle duplicate triplets. https://t.co/75EkOp4O2T
