jlengrand/Coding4Interviews
1
0
Fork 0
mirror of https://github.com/jlengrand/Coding4Interviews.git synced 2026-03-10 08:11:24 +00:00
Code Issues Packages Projects Releases Wiki Activity

Commit Graph

  • 350685863a feat(junie): added .devcontainer.json junie-init jetbrains-junie[bot] 2025-06-02 21:35:44 +00:00
  • 944be3c804 feat(junie): added .junie workflow jetbrains-junie[bot] 2025-06-02 21:35:44 +00:00
  • 2e18d7a53d Implements a loop detection method master julien lengrand-lambert 2013-12-09 17:49:39 +01:00
  • 073fec1c96 Finishes implementing the remove_duplicates method that won't store any more info. julien lengrand-lambert 2013-12-09 17:39:29 +01:00
  • df7bde48f3 Implements first version of duplicates removal. Prepares everything for another version that would not store any extra information julien lengrand-lambert 2013-12-08 20:26:27 +01:00
  • 57a852f3e8 Implements the get method, that returns an element at a given index julien lengrand-lambert 2013-12-08 20:12:03 +01:00
  • 10b1647674 Adds search method in the implementation julien lengrand-lambert 2013-12-08 20:03:51 +01:00
  • 7c2e8b5534 Finishes implementing delete julien lengrand-lambert 2013-12-08 19:58:55 +01:00
  • 94a9bd3626 The special case node = 0 is needed julien lengrand-lambert 2013-12-08 14:41:04 +01:00
  • 6b750028f9 Finished implementing a first version of delete_item julien lengrand-lambert 2013-12-08 14:39:30 +01:00
  • c64ae01a36 Starts implementing the delete_item method, that deletes the nth element from the list julien lengrand-lambert 2013-12-08 14:32:05 +01:00
  • e8a03abf8d implements the print method Julien Lengrand-Lambert 2013-12-07 16:20:46 +01:00
  • 757e3cbcd0 Implements has_next() method in list item Julien Lengrand-Lambert 2013-12-07 15:27:50 +01:00
  • 26ed3fe4d8 Starts working on Linked List. Single linked lists implementation for now. julien lengrand-lambert 2013-12-07 11:47:24 +01:00
  • d925aa9183 Coe seems to be ok now. julien lengrand-lambert 2013-12-07 10:00:52 +01:00
  • 1e88912eb8 Finishes implementing merge sort. Some more tests to be made before switching to something else julien lengrand-lambert 2013-12-07 09:57:27 +01:00
  • ec1dafcaec Creates first dummy test for empty table julien lengrand-lambert 2013-12-05 15:58:18 +01:00
  • c6abd4b2a1 Starts working on the MergeSort algorithm julien lengrand-lambert 2013-12-05 15:53:17 +01:00
  • 00268eabc7 Beautifies the code a bit julien lengrand-lambert 2013-12-05 09:55:20 +01:00
  • 445e965f52 First get method version implemented. How to test? julien lengrand-lambert 2013-12-05 07:26:28 +01:00
  • 6c6be8663c Starts implementing get method for neighbour based hashmap julien lengrand-lambert 2013-12-05 07:21:52 +01:00
  • b7364b40da Corrects the implementation of add. It is not possible any more to create use twice the same key. julien lengrand-lambert 2013-11-26 19:10:08 +01:00
  • 0267a97f33 Some different expectetions in the behaviour of the HashMap julien lengrand-lambert 2013-11-26 19:07:03 +01:00
  • d63e082551 Just moves HMWithItem to a better location in the file julien lengrand-lambert 2013-11-26 19:00:29 +01:00
  • b5d8de4faf Finishes implementing the bare simple HM ersion using items. Now going to modify the version handling collisions julien lengrand-lambert 2013-11-26 18:59:33 +01:00
  • 7297cec59b Adds hm implementation with items. Currently, this is just a copy paste from the bare simple hm implementation julien lengrand-lambert 2013-11-26 18:57:30 +01:00
  • c51ba44a98 Adds _HashMapItem object that will be used to properly handle collisions. Also adds documentation to the first HM implementation julien lengrand-lambert 2013-11-26 18:55:16 +01:00
  • ee382ac0a8 find_next_idx behaviour checked. Seems to work as expected Julien Lengrand-Lambert 2013-11-24 17:01:12 +01:00
  • 70d268983b Adds in neighbour implementation implemented and running. Behaviour not tested yet. Julien Lengrand-Lambert 2013-11-24 16:54:43 +01:00
  • 96d3c8ca00 Starts implementing a neighbour implementation Julien Lengrand-Lambert 2013-11-24 16:33:24 +01:00
  • 423bf21fed Also now implements get Julien Lengrand-Lambert 2013-11-24 16:28:46 +01:00
  • 2144671096 Tests add with collisions Julien Lengrand-Lambert 2013-11-24 16:20:14 +01:00
  • f66c95d8da Starts implementing add method of version with collisions. Julien Lengrand-Lambert 2013-11-23 18:06:43 +01:00
  • 1ec8b0672c Modifies HashMap to correspond to the usual scheme Julien Lengrand-Lambert 2013-11-21 20:22:49 +01:00
  • 8f51ce1123 Actually, I have to provide two inputs to add instead, use one to create the key and store the other in the table. This is the classical implementation of HM Julien Lengrand-Lambert 2013-11-21 20:18:55 +01:00
  • b1915d7192 Starts creating a dedicated object to store into hashmaps Julien Lengrand-Lambert 2013-11-21 20:17:27 +01:00
  • af8014a79a Implements a first get method. This doesnt take collisions into account yet. Also, we use strings to retrieve strings . . . Not really clever Julien Lengrand-Lambert 2013-11-21 19:57:32 +01:00
  • 7f8736c9ca Starts implementing get method of the HashMap Julien Lengrand-Lambert 2013-11-21 19:54:16 +01:00
  • 77ad11ea74 Adds collision testing Julien Lengrand-Lambert 2013-11-21 19:47:55 +01:00
  • 20fe41493b Starts implementing add method to fill the hash map Julien Lengrand-Lambert 2013-11-21 11:58:50 +01:00
  • bcadb29f5f Modifies hash method to stay within the range of the hash table Julien Lengrand-Lambert 2013-11-21 11:50:11 +01:00
  • 702f8999b3 Adds custom size of hash map table Julien Lengrand-Lambert 2013-11-21 11:40:29 +01:00
  • cccda38920 Finishes implementing hash method Julien Lengrand-Lambert 2013-11-21 11:08:35 +01:00
  • 03ca739a08 Starts implementing the hash method. Throws an exception if the length of value is inconsistent Julien Lengrand-Lambert 2013-11-21 10:36:12 +01:00
  • 494f57d699 Creates corresponding test class and implements first size() method Julien Lengrand-Lambert 2013-11-21 08:30:16 +01:00
  • ec4b556ba8 Starts implementing a Hash Table jlengrand 2013-11-21 08:19:49 +01:00
  • eb2f371e05 Finishes testing the iterator implementation Julien Lengrand-Lambert 2013-07-19 16:28:05 +02:00
  • bfcc796b3a Rolls out first version of iterator for retrieving ordered values of binary search tree Julien Lengrand-Lambert 2013-07-19 10:40:13 +02:00
  • 25936d8413 implements print tree method Julien Lengrand-Lambert 2013-07-15 16:31:07 +02:00
  • e731857f82 enhances print node to take care of more special cases Julien Lengrand-Lambert 2013-07-12 21:21:20 +02:00
  • cf753f8ac4 Implement simple print method for single node element Julien Lengrand-Lambert 2013-07-12 21:16:33 +02:00
  • 6c14c68d93 prepares implementation of flat print method Julien Lengrand-Lambert 2013-07-12 21:09:23 +02:00
  • ac878019fd is_search_tree implemented Julien Lengrand-Lambert 2013-07-11 23:24:37 +02:00
  • 0d7bd76b2a First is_search_tree attempt. Valid case seems to pass. Let s try the negation Julien Lengrand-Lambert 2013-07-11 23:20:59 +02:00
  • 81edb330eb Adds is_search_node that checks whether a node is possibly part of a binary search tree Julien Lengrand-Lambert 2013-07-09 19:48:16 +02:00
  • a511bb1687 Implement min, that find the lowest node value of a tree Julien Lengrand-Lambert 2013-07-08 17:24:47 +02:00
  • 1b7f6206f3 Implement max, that finx the highest node value of a tree Julien Lengrand-Lambert 2013-07-08 17:20:38 +02:00
  • 79980f3ad9 some small changes Julien Lengrand-Lambert 2013-07-08 17:06:52 +02:00
  • 3f7d84c896 Add method added. Also adds convenience method has_child in node class Julien Lengrand-Lambert 2013-07-08 17:05:14 +02:00
  • a6264998bc First test passes Julien Lengrand-Lambert 2013-07-07 11:27:40 +02:00
  • 6cf5ce85d8 Prepares binary search tree data structure. Julien Lengrand-Lambert 2013-07-07 11:22:18 +02:00
  • 40f77e4ea5 Seems to have a working version Julien Lengrand-Lambert 2013-06-28 18:40:19 +02:00
  • 0f12f99d1a First version with odd length works. Try more now Julien Lengrand-Lambert 2013-06-28 18:36:30 +02:00
  • 7166bb43d0 Length 1 case handled Julien Lengrand-Lambert 2013-06-28 18:09:52 +02:00
  • a9a97b64b7 Test inputs Julien Lengrand-Lambert 2013-06-28 17:51:41 +02:00
  • 02a0fe1273 First dumb unti test. We're good to start Julien Lengrand-Lambert 2013-06-28 17:44:38 +02:00
  • 53cb6af0d2 Starts implementing binary search algorithm Julien Lengrand-Lambert 2013-06-28 17:40:54 +02:00