Leetcode - Presum

 Ref the presum questions


325. Maximum Size Subarray Sum Equals k

560. Subarray Sum Equals K

525. Contiguous Array

1248. Count Number of Nice Subarrays

1371. Find Longest Substring Containing Vowels in Even Counts

$ 930. Binary Subarrays With Sum


974. Subarray Sums Divisible by K

523. Continuous Subarray Sum

2845. Count of Interesting Subarrays

528. Random Pick with Weight

1124. Longest Well-Performing Interval

Comments

Post a Comment

Popular posts from this blog

Interview Question

Interview question asked: What is MVVM ? Why it is different from MVC? What is dependency injection? What is observer pattern? What is system service and how to implement it? HAL AIDL implement? Stable AIDL in AOSP? What is JNI?
Read more

AOSP Question

 What is AOSP? What is Android Boot Process? What is Project Treble? Why is Project treble required? What is the fragmentation of Android or the architecture of Android? What is the role of the Application layer? What is the role of the Framework Layer? What is the role of the HAL Layer? What is the role of the Kernel Layer? What is HIDL? How do we implement it if want to add a new HW? What is AIDL? What is GSI? What is VNDK? how it is different from NDK? How to add a new Device in AOSP? What is the role of the BoardConfig file? What is the role of Manifest.xml? What is a repo tool? How we can use the repo tools? If GIT is already there why do we need to use the repo? How to create a new manifest in the repo? How to use the existing manifest in the repo? What "repo status" command will do? How to add the project to the manifest file in the repo? What are the challenges that you faced in repo sync? What build tools exist in AOSP? What is the SOONG build system? How bp file is ...
Read more