DataStructureFundamentalPython/sources, branch master UCSD Data Structures Fundamentals exercises done in Python https://www.edx.org/course/data-structures-fundamentals-uc-san-diegox-algs201x Binary Search Tree check harder version done! 2019-06-13T01:10:34+00:00 Haidong Ji 2019-06-13T01:10:34+00:00 99caed4f61576f75bea5c824b89caf14997f7082 2 simple changes were all needed :) 
2 simple changes were all needed :)
Binary Search Tree check done! 2019-06-12T15:55:58+00:00 Haidong Ji 2019-06-12T15:55:58+00:00 ced86db4658bdc3aba7e3f59991c1723ceae0531 Easy after Java version is done. I'm happy that I did this in 3 languages (Java, Python, C++). I can really tell that Python is more succinct, whereas Java is really verbose. Fun stuff :) 
Easy after Java version is done. I'm happy that I did this
in 3 languages (Java, Python, C++). I can really tell that
Python is more succinct, whereas Java is really verbose.

Fun stuff :)
tree traversal done (in/pre/post) orders 2019-06-09T21:51:07+00:00 Haidong Ji 2019-06-09T21:51:07+00:00 560bb4c29cbbfd940e2773df0ff28d0315b16517 Not too bad since I worked it out in Java first 
Not too bad since I worked it out in Java first
Rabin-Karp string search done! 2019-03-17T16:53:40+00:00 Haidong Ji 2019-03-17T16:53:40+00:00 151a820c72161aacde623b444ab1f137689a36f5 Not too bad to convert Java to Python. Converting the for loop and playing indexing is interesting, good exercise. 
Not too bad to convert Java to Python. Converting the for loop
and playing indexing is interesting, good exercise.
Hashing with chains done! 2019-03-13T02:33:24+00:00 Haidong Ji 2019-03-13T02:33:24+00:00 20bda975f02bdf906e924f176c27fd95df8c8424 I was tricked by how to create a list of empty list. This line solved the problem: self.elems = [[] for i in range(n)] 
I was tricked by how to create a list of empty list. This line
solved the problem:
self.elems = [[] for i in range(n)]
Phone book done! 2019-03-10T01:44:21+00:00 Haidong Ji 2019-03-10T01:44:21+00:00 0c0755cd6087679207063d2d31fed9a2cda23f31 






Merging tables done.
2019-03-05T02:51:19+00:00

Haidong Ji

2019-03-05T02:51:19+00:00

9b38f4a68773bb08fe923136c9faeade6a9794e9

Not too bad since I worked it out in Java. A bit surprised that
Python class is used in starter file, but I made it testable
and wrote test cases. All is well.





Not too bad since I worked it out in Java. A bit surprised that
Python class is used in starter file, but I made it testable
and wrote test cases. All is well.







Priority queue parallel job processing done!
2019-02-22T03:32:22+00:00

Haidong Ji

2019-02-22T03:32:22+00:00

421f2e783af773712a5e7a799f7cbaca69ab7a21

Not too bad since I worked it out in Java. Good practice of heapq module in Python! A lot of fun :)





Not too bad since I worked it out in Java. Good practice of heapq module in Python! A lot of fun :)







Build heap done!
2019-02-17T15:35:46+00:00

Haidong Ji

2019-02-17T15:35:46+00:00

602995c859265493dd94996d1626e6de44d512e6

Not too bad, since the Java version has been worked out.





Not too bad, since the Java version has been worked out.







Network Packet done!
2019-01-29T22:18:10+00:00

Haidong Ji

2019-01-29T22:18:10+00:00

e314d433e66a6177c8a17e3fca5acc59005e1b06

It's not too bad, since I worked things out in Java first. 2
things are of note: 1. Java Deque's pop is Python Deque's
popleft. 2. I didn't use an iterator to remove items. It
seemed to work fine.





It's not too bad, since I worked things out in Java first. 2
things are of note: 1. Java Deque's pop is Python Deque's
popleft. 2. I didn't use an iterator to remove items. It
seemed to work fine.