Learn & Share

-
Computer science is awesome both in terms of words and code. Sometimes I solve programming problems that are worth sharing with others so that others can learn unique ways to solve that kind of problems. Similar is the case with software design problems. To share my findings with others I have started something new, bits of code & design ... I will share my words here :) 

Comments

Post a Comment

Popular posts from this blog

Longest Subarray with Sum greater than Equal to K

-
Given an array of N integers. The task is to find the maximum length subarray such that the sum of all its elements is greater than or equal to K. Input: arr[]= {-1, 4, -2, -5, 6, -8}, K=0 Output: 5 Explanation: {-1, 4, -2, -5, 6} forms the longest sub array  with sum=2. Discussion : class Pair { private int sum ; private int index ; Pair ( int sum , int index ){ this . index = index ; this . sum = sum ; } public int getSum () { return sum ; } public int getIndex () { return index ; } } import java.util.* ; public class test { static int findInd ( ArrayList < Pair > preSum , int n , int val ) { int l = 0 , h = n - 1 , mid ; int ans = - 1 ; while ( l <= h ) { mid = l + ( h - l )/ 2 ; if ( preSum . get ( mid ). getSum () <= val ) { ans = mid ; ...
Read more

Search in Rotated Sorted Array

-
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value X to search. If X found in the array return its index, otherwise return -1 Discussion :  Case 1 : No duplicate exists in the array public int search ( int [] nums , int x ) { int left = 0 ; int right = nums . length - 1 ; while ( left <= right ){ int mid = left + ( right - left )/ 2 ; if ( x == nums [ mid ]) return mid ; if ( nums [ left ]<= nums [ mid ]){ if ( nums [ left ]<= x && x < nums [ mid ]){ right = mid - 1 ; } else { left = mid + 1 ; } } else { if ( nums [ mid ]< x && x <= nums [ right ]){ left = mid + 1 ; } else { right = mid - 1 ; } } } retu...
Read more

Consistent Hashing

-
Consistent Hashing is a distributed hashing scheme that operates independently of the number of servers or objects in a distributed  hash table  by assigning them a position on an abstract circle, or  hash ring . This allows servers and objects to scale without affecting the overall system. In other words,  It facilitates the distribution of data across a set of nodes in such a way that minimizes the re-mapping/ reorganization of data when nodes are added or removed. BENEFITS OF CONSISTENT HASHING: Enables Elastic Scaling of cluster of database/cache servers Facilitates Replication and partitioning of data across servers Partitioning of data enables uniform distribution which relieves hot spots Must Read Places: https://www.toptal.com/big-data/consistent-hashing https://towardsdatascience.com/consistent-hashing-simplified-7fe4e512324 https://www.acodersjourney.com/system-design-interview-consistent-hashing/ https://www.youtube.com/watch?v=zaRkO...
Read more