👨‍💻
Cracking-Interview
CtrlK
  • Data Structures and Algorithms
  • Arrays
  • Linked List
  • Strings
  • Binary Tree
  • Stack and Queue
  • Hash Table
  • Binary Search
  • Binary Search Tree
  • Bit manipulation
  • Graph
  • Disjoint Sets(Union-Find)
  • Heap and Priority Queue
  • Trie
  • Dynamic Programming
  • Greedy Algorithms
  • Backtracking
  • Sub Array and Sliding Window Problems
    • 1.Maximum Subarray Sum
    • 2.Maximum Product Subarray
    • 3.Maximum Sum Circular Subarray
    • 4. Maximum Absolute Sum of Any Subarray
    • 5. K-Concatenation Maximum Sum
    • 6.Subarray Sum Equals K
    • 7. Continuous Subarray Sum
    • 8. Contiguous Array
    • 9.Minimum Size Subarray Sum >=k (positive no)
    • 10. Max Subarray sum of positive no <= k
    • 11. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
    • 12. Maximum Subarray Sum with One Deletion
    • 13. Shortest Subarray with Sum at Least K (Negative Numbers)
    • 14. Frequency of the Most Frequent Element
    • 15. Count Number of Nice Subarrays
    • 16. Binary Subarrays With Sum
    • 17.Number of Substrings Containing All Three Characters
    • 18. Find Two Non-overlapping Sub-arrays Each With Target Sum
    • 19. Maximum Points You Can Obtain from Cards
    • 20. Longest Repeating Character Replacement
    • 21. Subarrays with K Different Integers
    • 22. Replace the Substring for Balanced String
    • 23. Maximize the Confusion of an Exam / Max Consecutive Ones III
    • 24. Subarray Sums Divisible by K
  • Design
  • Maths
  • Sorting-Algorithms
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
  • Expected Interview MCQ and Questions c++
  • Concepts in C++
  • System Design Questions
  • 💾DBMS
    • Introduction
    • RBMS
    • JOINS
    • SQL
  • 🖥️OS
    • OS and Its Types
    • Process Concept and Threads
    • Process Synchronization
    • Deadlock in Operating System
    • Memory Management
    • Imp Questions of OS for Interviews
  • 🚙OOPS
    • Introduction and Definitions
  • 📨COMPUTER-NETWORKS
    • OSI | TCP IP Model
    • Topology
    • Network Devices
    • IP Address
Powered by GitBook
On this page

Was this helpful?

Sub Array and Sliding Window Problems

Problems Related to finding Subarray

1.Maximum Subarray Sum2.Maximum Product Subarray3.Maximum Sum Circular Subarray4. Maximum Absolute Sum of Any Subarray5. K-Concatenation Maximum Sum6.Subarray Sum Equals K7. Continuous Subarray Sum8. Contiguous Array9.Minimum Size Subarray Sum >=k (positive no)10. Max Subarray sum of positive no <= k11. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target12. Maximum Subarray Sum with One Deletion13. Shortest Subarray with Sum at Least K (Negative Numbers)14. Frequency of the Most Frequent Element15. Count Number of Nice Subarrays16. Binary Subarrays With Sum17.Number of Substrings Containing All Three Characters18. Find Two Non-overlapping Sub-arrays Each With Target Sum19. Maximum Points You Can Obtain from Cards20. Longest Repeating Character Replacement21. Subarrays with K Different Integers22. Replace the Substring for Balanced String23. Maximize the Confusion of an Exam / Max Consecutive Ones III24. Subarray Sums Divisible by K

Previous16. Beautiful ArrangementNext1.Maximum Subarray Sum

Last updated 3 years ago

Was this helpful?