andreyka26_se
which replication can guarantee no data loss in the case above
So, there is only 1 correct answer for all the cases:
✅ Consensus(raft, paxos), it will guarantee everything.
❌ Async leader follower - might loose data on leader election
❌ Sync leader follower - does not give high availability, as any follower crash will make system unresponsive, and not able to process writes
✅❌ Leader Leader - depends, if operations are not concurrent we will not loose the data and guarantee high availability, once we write to any leader it will be synced. Concurrency might bring data loss only when Last Write Wins conflict resolution.
✅❌ Leaderless - same as leaderfull, if no concurrent operations - we will not have any conflict with w + r > n, but with concurrent operation, again on read repair when there is a conflict we might override some writes, that got accepted by quorum.
✅ Consensus(raft, paxos), it will guarantee everything.
❌ Async leader follower - might loose data on leader election
❌ Sync leader follower - does not give high availability, as any follower crash will make system unresponsive, and not able to process writes
✅❌ Leader Leader - depends, if operations are not concurrent we will not loose the data and guarantee high availability, once we write to any leader it will be synced. Concurrency might bring data loss only when Last Write Wins conflict resolution.
✅❌ Leaderless - same as leaderfull, if no concurrent operations - we will not have any conflict with w + r > n, but with concurrent operation, again on read repair when there is a conflict we might override some writes, that got accepted by quorum.
🔥1
andreyka26_se
which replication can guarantee no data loss in the case above
Pls, give me feedback about such polls. Did you like it, was it not useful at all, was it too hard, ambiguous? Should I continue using them, or better just posting the "results" in the way: "these are replications that guarantee no data loss"
👍7
Daily
Not hard, not bad, greedy problem.
https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/description/?envType=daily-question&envId=2025-11-13
#daily #medium
Not hard, not bad, greedy problem.
https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/description/?envType=daily-question&envId=2025-11-13
#daily #medium
👍2
Daily
Actually a nice one. Kind of "area" line sweep. Nice to learn a bit.
The hint: the intuition you can derive from is try to do it with 1D array and columns updates on it.
https://leetcode.com/problems/increment-submatrices-by-one/description/?envType=daily-question&envId=2025-11-14
#daily #medium
Actually a nice one. Kind of "area" line sweep. Nice to learn a bit.
The hint: the intuition you can derive from is try to do it with 1D array and columns updates on it.
https://leetcode.com/problems/increment-submatrices-by-one/description/?envType=daily-question&envId=2025-11-14
#daily #medium
Daily
As I told you before, daily is piece of shit. No way this is medium. But yeah.
https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/description/?envType=daily-question&envId=2025-11-15
#daily #medium
As I told you before, daily is piece of shit. No way this is medium. But yeah.
https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/description/?envType=daily-question&envId=2025-11-15
#daily #medium
🔥2
Daily
Nice problem, pretty easy. But you need to recall how to do arithmetic progression: https://en.wikipedia.org/wiki/Arithmetic_progression
#daily #medium
Nice problem, pretty easy. But you need to recall how to do arithmetic progression: https://en.wikipedia.org/wiki/Arithmetic_progression
#daily #medium
Daily
Easy, great start of the Monday
https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/description/?envType=daily-question&envId=2025-11-17
#daily #easy
Easy, great start of the Monday
https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/description/?envType=daily-question&envId=2025-11-17
#daily #easy
🔥2