Skip to main content
Interview-Mapagam

#LeetCode

Browse articles tagged with #LeetCode

  • DSA Problems

    Majority Element Problem Solution

    Complete Java implementation for finding the majority element in an array with O(n) time and O(1) space complexity using Boyer-Moore Voting Algorithm.

    • CategoryDSA Problems
    • UpdatedFebruary 27, 2025
    • Reading time15 min read
  • DSA Problems

    Move Zeroes Algorithm Solution

    Complete Java implementation for moving all zeroes to the end of an array while maintaining relative order of non-zero elements.

    • CategoryDSA Problems
    • UpdatedFebruary 20, 2025
    • Reading time15 min read
  • DSA Problems

    Maximum Subarray Problem Solution

    Complete Java implementation of Kadane's algorithm for finding maximum subarray sum with O(n) time and space complexity analysis.

    • CategoryDSA Problems
    • UpdatedJanuary 30, 2025
    • Reading time15 min read
  • DSA Problems

    Best Time to Buy and Sell Stock Algorithm Solution

    Complete Java implementation for maximizing profit from stock transactions with detailed time complexity analysis and trade-off considerations.

    • CategoryDSA Problems
    • UpdatedJanuary 23, 2025
    • Reading time16 min read

Stay in the Loop

Get curated DSA patterns, coding problems, frontend and backend LLD/HLD, and AI/ML System Design insights delivered straight to your inbox. No spam, just focused interview and engineering content.