Skip to main content

Dynamic Programming in JAVA


  • String
    • Longest common subsequence
    • longest increasing subsequence
    • longest common substring
    • edit distance
  • Graphs
    • bellman ford
    • floyd's all pair shortest
  • chain matrix multiplication
  • subset sum
  • 0/1 knapsack
  • Travelling salesman problem

Comments

  1. 법안 작성자인 대리오 프로머 주하원의원은 '주민들이 신용카드로 온라인 도박을 함으로써 엄청난 돈을 날릴 수 있다'고 경고했다. 당국은 주민들이 접속 가능한 인터넷 도박 사이트가 약 1천400개에 달하는 것으로 추정하고 있다. 캘리포니아는 경마와 포커 사이트 복권,포커 등의 카드 게임은 허용하되 인디언 보호지역을 제외하고는 라스베이거스 스타일의 카지노 운영을 금지하고 있다. 그러나 경찰의 단속을 교묘하게 피하면서 불법 인터넷 카지노게임을 통해 연간 수조원 이상의 탈세와 연간 해외로 빠져 나가는 액수만 10조원 이상에 달하는 것으로 추산되고 있다는 지적이다. 넷플릭스와 SK브로드밴드 간의 해묵은 법적공방으로 대변되는 ‘망 이용료’ 논쟁이 올해 국회 국정감사에서도 되풀이되고 있다.

    ReplyDelete

Post a Comment

.

Popular posts from this blog

Calculating size of User and Cache storage

user storage:- it can be solved using same scenario as mentioned in first article . https://tech.nazarmubeenworks.com/2019/08/basics-of-system-design-chapter-0.html Suppose there are 12 Million of users are adding every year meaning 1 Million per month. So if we consider 5 year there will be around 60 million of users. Now in terms of data we can look to our DB table and get information about it. A user will be generally having name , id , address , some forien keys . Lets assume 10 columns with each column on an average storing 4 byte of data. 10*4 = 40 bytes of data for one user. 60 * 10^6 * 40 = 2400 * 10^6 = 2.4 * 10^9 = 2.4 GB of data we need to store only user values. Also while calculating storage for the user there is also one important point we need to remember is of ids. If we are going to have 60 Million of users which means 60*10^6 users so unique id’s will be as we know below figures are almost equal

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md