dubesar / ultimate-java-resources Goto Github PK

Add HashSet in Java Collections with example and comment it properly.

Add Hashmaps , it's implementation. Properly comment the code and also put jt in relevant folder.

Seperate the code files accordingly to where they should belong like make a seperate DS folder and put all the relevant stuffs and same for algos

Like prefix sum array, binary search etc should be in algos and java loops, linkedlist , stack in data structures . Name the folder properly.

Add implementation of coin change in Java and create a separate folder for Dynamic Programming. Comment the code properly and explain the code in the form of comments.

Add code for LCS in dynamic programming and explain the code using comments.

Make a new math folder and add code to the totient of a natural number and comment on the code properly.

Matrix chain multiplication in Java and comment on the code giving examples.

Add DFS algorithm and explain using example. Comment the code properly.

Add code for linear regression and comment on it properly.

Give an example of ArrayList and explain using comments.

Add two pointer algorithm example in Java. Comment the code properly

Add relevant functions that have been added till now and and give introduction of the repository.

For making calculations of O(n^2) to O(n) sliding window algo. can be used

Add implementation of 2d Array in Java using ArrayList and properly comment on the code.

Add implementation of edit distance in Java and comment the code properly. Add your code in Dynamic Programming folder if present else create the Dynamic Programming folder.

Add different methods to use loops in Java including for, while, for each.

Add subset problem using Dynamic Programming and comment the code properly.

Add implementation of prefix array in ArrayList. Comment the code properly

Add treeset example in Java and remember to comment with proper explanation.

Add LIS code in Dynamic Programming and explain the code using comments.

Add code to compute the number of divisors of a number and add the comments properly.

Add code for number of connected components in a graph. Properly comment the code.

Add min heap and max heap implementation in Java and comment properly in code.

Add Stack and Queue to readme and follow markdown as followed in current readme.

Add priority queue example with proper comments.

Add inorder, preorder and postorder traversals and comment properly.

Add both Binary search as well as Linear search returning the index of the required element and throw an error if there is no presence of the element. Comment the code properly.

Add Dijkstra code for a given graph having a start and end point. Comment the code properly.

Implement 0-1 Knapsack problem in Java and comment the code properly.

Implement Weighted Job Scheduling and comment on the code properly by giving examples.

Add all the possible methods to calculate nth prime number. Comment the code properly.

Add BFS code with an example in algorithms. Comment the code properly.

Use ArrayList to make a queue. Add comments properly.

Add a Machine learning folder and then code for logistic regression and comment the code properly

Make a security folder and explain the secure Random methods in the form .md file and also embed relevant code and explain it properly.

Add implementation of climbing stairs in Java and comment the code properly. Add your code in Dynamic Programming folder if present else create the Dynamic Programming folder.

Create a Documentation folder and add basic documentation for OOPS having concepts like abstraction , encapsulation , inheritance. Do give real world examples for each. And possibly add small code snippets inside the documentation itself for each related concept.

Add linkedlist and all the operations like deletion, insertion and all possible functions and explain each function with comments

Create a Networking folder and add documentation of Socket programming with proper markdown and also give example in documentation in form of code.

Also comment the codes well and write the documentation properly.

Add binarysearch inbuilt methods.

Add oops section for readme with proper markdown.

Add lower bound and upper bound in Java. Comment the code properly.

Add implementation of Trie in Java using one example of a dictionary-based graph and comment on the code properly.

Update Readme according to the present format with all the present stuffs in the code base.
Properly mention each and every algorithms newly added.

Add stack operation using ArrayList like push and pop

Update readme with all the new updates in the repository and follow the markdown in the readme

Add heapsort implementation in Java. Also write if any inbuilt functions are present. Comment the code properly.

Add Polymorphism concept in oops with proper guidelines mentioned for oops section.