Zig-Zag World of Algorithm and Data Structures

1. Fail Over: Basically the fail over is kind of following: But it is really more complex than above. If we double click a little, failover...

Before moving to the actual design we should scope the design problem. To scope the problem we must come up with the load, storage required,...

Problem:  You are given the logs in [timestamp, user, resource] format which indicates the timestamp  when user access a resource. You need ...

Problem: You are given the logs in [timestamp, user, resource] format which indicates the timestamp  when user access a resource. A user se...

Problem: In a given sorted array, find the greatest element which is less than a given number x. Example: Input: arr = [7, 12, 16, 20, 24 ...

Problem: You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell, 1 representing a fresh ora...

Problem: Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i]...