gopalakrishnan-anbumani/competitive-programming

Solution and Links for the Competitive Programmings, Data Sturucture and Algorithms, Problems,

This Repository for daily update of What I am Learning related to Programming.

Competitive-Programming

Solution and Links for the Competitive Programmings, Data Sturucture and Algorithms, Problems,

Time Complexity

coffee-break introduction to time complexity of algorithms https://medium.freecodecamp.org/a-coffee-break-introduction-to-time-complexity-of-algorithms-64df7dd8338e

Dynamic Programming

“Dynamic Programming vs Divide-and-Conquer� https://itnext.io/dynamic-programming-vs-divide-and-conquer-2fea680becbe https://www.cdn.geeksforgeeks.org/trapping-rain-water/

Data Structure

https://medium.com/swlh/introduction-to-data-structures-9134b7d064a6 http://www.java67.com/2018/06/data-structure-and-algorithm-interview-questions-programmers.html?m=1

Tree

http://www.cs.yale.edu/homes/aspnes/pinewiki/DepthFirstSearch.html http://mishadoff.com/blog/dfs-on-binary-tree-array/ https://medium.com/the-renaissance-developer/learning-tree-data-structure-27c6bb363051 https://medium.com/@connorleech/depth-first-and-breadth-first-search-on-trees-in-javascript-58dcd6ff8de1 MIT Offcial Site : https://ocw.mit.edu/index.htm video course: https://www.class-central.com/course/coursera-greedy-algorithms-minimum-spanning-trees-and-dynamic-prog/mming-7350 https://www.coursera.org/learn/data-structures MIT Youtube Videos : https://www.youtube.com/channel/UCEBb1b_L6zDS3xTUrIALZOw

Binary Tree:

1.Insert -> Done
2.Delete node: -> Done
	a. With no children
	b. with 1 children
	c. with 2 children
3. Find -> Done
4. Search -> Done
	a. Inorder
	b. PreOrder
	c. PostOrder
	d. Level Order Search - BFS
5. Get Height -> Done
6. Get Size -> Done


a. Binary Min Heap
	1.Add Node -> Done
	2.Extract Min -> TO DO 

Java

http://snowdream.github.io/115-Java-Interview-Questions-and-Answers/115-Java-Interview-Questions-and-Answers/en/index.html http://www.in28minutes.com/ https://orrsella.gitbooks.io/soft-eng-interview-prep/content/ https://github.com/andreis/interview

Java Interview

https://www.java-success.com/?gclid=CjwKCAjwyrvaBRACEiwAcyuzRMq0fRwMcw1XSpHx0sC8OJfqllG-OiYOJ51X9UJvw8bhEE9eHQwPuBoC20QQAvD_BwE

Maths

Modular Arithmetic Modular Exponential

System Design

https://sourcemaking.com/design_patterns/object_pool

String

http://www.java67.com/2018/06/top-35-java-string-interview-questions.html?m=1

Maths

https://www-cs-faculty.stanford.edu/~knuth/taocp.html https://projecteuler.net/index.php?section=problems