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

.

Nth Node from End in LinkedList

Nth Node from End in LinkedList 1) Find length of linked list. 2) Traverse (length-position+1) element from begin. //nth Node from end public Node nodeFromEnd ( Node head , int position ){ Node temp = head ; int length = 1 ; while ( temp . next != null ) { length ++; temp = temp . next ; } System . out . println ( "length" + length ); temp = head ; int c = 1 ; while ( c !=( length - position + 1 )) { temp = temp . next ; c ++; } return temp ; }

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

Concepts of Computer Science

Search This Blog