Skip to main content

Notes

  1. Complexity Analysis Blog
  2. C# Blog
  3. OOP Blog
  4. Pointer Blog
  5. Array and String
  6. STL
  7. SOLID
  8. Recursion
  9. CF Expert Blog
  10. Codechef Rating Ladder
  11. 400 Problem List
  12. Orientation
  13. Source Code
  14. Resume Template
  15. DSA Classroom
  16. Fundamentals Classroom
  17. Interview Classroom

Task​

  1. build 3 Portfolio
  2. Read 3 blog on CP
  3. upsolve
    1. CF Round 1082
    2. CF Edu Round 187 = complete
    3. CF Round 1083
    4. weekly 489
    5. weekly 490
    6. biweekly 176 - 1
    7. weekly 491 - 1
    8. biweekly 177
  4. cpsacademy(blog+video)
  5. implment cpp stl next_permuations
  6. explore c++ stl (map(bst), unordered_map(hashmap))
  7. implment realloc with malloc with capacity and size variable and note it down(append with existing note)

Problems​

Array & Strings​

https://leetcode.com/problems/kth-largest-element-in-an-array https://leetcode.com/problems/rotate-array https://leetcode.com/problems/group-anagrams https://leetcode.com/problems/rearrange-array-elements-by-sign (support for in-place)

Matrix​

https://leetcode.com/problems/rotate-image https://leetcode.com/problems/flipping-an-image

Blog​

difference between avg case and tight bound

frequency count with: সেক্ষেত্রে অন্য পদ্ধতি ব্যবহার করতে হবে (যেমন nested loop দিয়ে, বা পরে sorting শিখলে আরো ভালো উপায় পাবে)। - array practice/onek data

String থেকে Spaces সরাও​

Fixed Sliding Window​

  1. Sliding Subarray Beauty
    1. 06 April, 2026: 00.40.44 ❌
      • Failed at edge cases
        • set doesn't allow duplicates, multiset does
        • next function is used to access set with index
        auto it = next(st.begin(), x - 1);
        vec.push_back(*it);
        next is lineare caused O(k)O(k) time complexity, eventually the program become O(n∗k)O(n * k)
        • erase function remove all the element, get the ... of the specific item through find
        st.erase(nums[i - k]);
        st.erase(st.find(nums[i - k]));
        • Reduce the time complexity with frequency array(Check the constraints), if require implment the xth smallest number function.
  2. Number of Sub-arrays of Size K and Average ≥ Threshold
  3. Check If a String Contains All Binary Codes of Size K
  4. Find All Anagrams in a String
  5. Permutation in String