Mutex and Semaphores in Operating system.
Effective Synchronization Techniques: A Look at Mutexes and Semaphores
May 26, 20243 min read
Command Palette
Search for a command to run...
Latest articles
WebSocket and Socket.IO: Revolutionizing Web Interactivity
Unveiling the Power and Versatility of WebSocket's in Modern Web Communication
May 23, 20244 min read
Leetcode Daily Problem
705. Design HashSet Design a HashSet without using any built-in hash table libraries. Implement MyHashSet class: void add(key) Inserts the value key into the HashSet. bool contains(key) Returns whether the value key exists in the HashSet or not. v...
May 30, 20231 min readLeetcode Problem
2708. Maximum Strength of a Group You are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of students with maximal strength, where the strength of a group of stude...
May 29, 20231 min readLeetcode Problem
539. Minimum Time Difference Given a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes difference between any two time-points in the list. timePoints = ["23:59","00:00"] approach to this question is that we will first co...
May 29, 20231 min readLeetcode Problem 560. Subarray Sum Equals K
the sliding array technique cannot be applied to an array which contains negative elements. int subarraySum(vector<int>& nums, int k) { int n=nums.size(); int i=0; int j=0; int curr_sum=0; int cnt=0; ...
May 26, 20231 min readLongest K unique characters substring
this problem is done using the sliding window technique.. In this, we will first make a map that will store characters and their count until the size of the map is less than k and increment j by one every time until the map size is less than k. once ...
May 26, 20231 min readLeetcode Daily problem
2542. Maximum Subsequence Score In this approach, we will try to maximize the sum by summing the maximum values together and multiplying the product with corresponding min values.... class Solution { public: long long maxScore(vector<int>& nums...
May 25, 20231 min readLeetcode Daily Problem
934. Shortest Bridge This is the problem through which we can understand how dfs and bfs work in any algorithm whether it is graphs, trees or anyone. In this problem there are two islands (islands are a combination of 1's and water is represented by ...
May 24, 20232 min read