Few questions for HLD/LLD 1. Url shortener app 2. Restaurant booking system 3. Video sharing app (eg. YouTube) 4, Hotel booking system (eg. AirBnb) 5. Web crawler 6. Search engine (eg. google search) 7.
comparison b/w Container and Virtual-Machine Kubernetes (Container Orchestrator) help to manage container (either Docker container or any other container) and Auto Scaling feature. k8 is from Google and in language Golang
Data Structure: Array Stack Queue LinkedList Tree Tries Graph Hashtable Languages & Data Structure Divide & Conquer technic for solving below problems: Search algo ( Binary search | Quick Sort | Merge Sort ) & Recursion will help- Fibanacci series number factors Edit distance Longest common subsequence Longest palindrome number of paths for last cell
Github link for some of the problems: DS_CodeProb Fibonacci Series numbers of the series is calculated as: F(n) = F(n-1) + F(n-2) where: F(n) is the term number. F(n-1) is the previous term (n-1). F(n-2) is the term before that (n-2) 1. Problem: find nth number of Fibonacci series recursive function - time complexity: O ( 2 n ) and space complexity: O(n) public int Fib(int num) { if(num<=0)return -1; if(num==1) return 0; if(num==2) return 1; return (fib(num-2) + fib(num-1); } optimized Fibonacci function using Memoization and Bottom-up Dynamic Programming T ime Complexity : O ( n ) O(n) & Space Complexity: O ( n ) public int Fib(int n) { if (n<=0) return -1; if (n==1) return 0; if(n==2) return 1; Dic...