Will the Guru

  • Processes in Operating System

    What is Process? Process is an instance of a program that is being executed. When we write up a computer program in a text file and when it gets loaded to memory, it becomes a process. Resources like CPU time or memory gets allocated to each process, which makes it possible to perform all the… Read more

  • Soft limit vs Hard limit

    Soft limit and Hard limit are the limitations set on certain resources that are allocated to different users. Those resources include CPU time, processes, memory etc. Soft limit vs Hard limit Soft limit Soft limit is a warning limit that warns you are reaching resource usage to a danger level Users/processes can exceed the soft… Read more

  • Numeric Data Types in Java

    Numeric Data Types in Java

    Integral Data Types Integral data type is a data type that represents numeric data whose values are integers. From Java, there are 5 integral data types, byte , short, int long and char. 1. byte data type byte data type is a 8 bit signed integral data type Range from -128 to 127 ( -2^7… Read more

  • Bit Manipulation in Java

    Signed vs Unsigned Signed variables – Such as signed integers, which can store both positive and negative range of numbers. Unsigned variables – Such as unsigned integers that will only represent positive numbers. Both signed and unsigned variables of the same data type have the same range, but unsigned variable can represent larger number than… Read more

  • Optimistic Lock vs Pessimistic Lock

    What is Lock? Lock is a technique that assures data integrity and atomicity when multiple processes/applications access database concurrently. There are different levels of locking, but from this post, we will focus on transactional locking, especially Optimistic Lock and Pessimistic Lock for concurrency control. Optimistic Lock Optimistic Lock is a strategy to manage your data… Read more

  • Tree Problem Solutions

    Top-Down Solution Using the value that came up with the first node, pass the value to the children nodes. It can be considered as pre-order tree traversal. If you can use parameters and the value of the node itself to determine what should be the parameters passed to its children, you should use “Top-Down” solution.… Read more

Availability (2) Binary Search Tree (2) Consistency (2) Design Doc (1) DFS (3) Durability (2) Dynamic Programming (4) Graph (7) HashMap (3) Linked List (3) List (2) Monotonic (3) MSA (2) Performance (2) Prefix Sum (4) Rate Limiter (3) Replication (2) Scalability (3) Sliding Window (8) System Design (22) Thread (2) Trie (3) Two Pointers (3) Union-Find (6) WebSocket (2) ⭐️ (6) ⭐️⭐️ (4) ⭐️⭐️⭐️ (11) ⭐️⭐️⭐️⭐️ (24) ⭐️⭐️⭐️⭐️⭐️ (41)