Showing 0-0 of 0 results
| # | Exercise Title | Features | Description | Platform | Keywords |
|---|---|---|---|---|---|
| 1 | Path lengths in binary tree | Code Completion | Your task is to compute a set of all path lengths in a binary tree. For example, given this tree, | CodeCheck | Tree Structures |
| 2 | Letter frequency map | Code Completion | Your task is to produce a map of the frequencies of all letters in a string. Letters are represented as... | CodeCheck | Tree Structures |
| 3 | Unique words in two string sets | Code Completion | Implement a method that receives two arrays of strings and determines which words are unique to each. | CodeCheck | Tree Structures |
| 4 | Make Person class comparable | Code Completion | The program below will fail to run because the Person class does not implement the Comparable interface. Modify the class... | CodeCheck | Tree Structures |
| 5 | Hash code for Person class | Code Completion | When you add instances of the given Person class in a HashSet, the resulting hash set is too large. Evidently,... | CodeCheck | Tree Structures |
| 6 | Map words to their lengths | Code Completion | Given an array of strings, create a tree map with each string as a key and its corresponding value the... | CodeCheck | Tree Structures |
| 7 | Letter set | Code Completion | Your task is to produce a set of all letters in a string. Letters are represented as strings of length... | CodeCheck | Tree Structures |
| 8 | Hash code for LabeledPoint | Code Completion | Implement the hashCode method for the LabeledPoint class so that equal objects have the same hash code and that unequal... | CodeCheck | Tree Structures |
| 9 | A fast priority queue | Code Completion | It is possible to provide a fast priority queue implementation if the inserted items have a bounded number of integer... | CodeCheck | Tree Structures |
| 10 | Map word lengths to words | Code Completion | Given an array of strings, create a tree map whose keys are the string lengths and whose values are the... | CodeCheck | Tree Structures |
| 11 | Call Structure for the Fibonacci Sequence Problem | Algorithm Visualization | Slideshow showing the tree structure for calls by a recursive implementation of the Fibonacci sequence calculation. | OpenDSA | Dynamic Programming, Fibonacci Sequence |
| 12 | Call Structure for the Chained Matrix Multiplication Problem | Algorithm Visualization | Slideshow showing the tree structure for calls by a solution to the chained matrix multiplication problem. | OpenDSA | Dynamic Programming, Chained Matrix Multplication Problem |
| 13 | Bintree Interactive Visualization | Algorithm Visualization, User Supplied Data | Interactive Algorithm Visualization for the Bintree data structure. User can click to indicate where a point should be inserted or... | OpenDSA | Bintree |
| 14 | Full Binary Tree Serialization Slideshow: Mark Bits | Algorithm Visualization | Slideshow how to reconstruct a full binary tree from a serialized representation of its node values. All that is needed... | OpenDSA | Serialization, Binary Tree |
| 15 | The Class for Representing a Bank Account | Construct a class that represents a basic bank account. This class should contain data representing the name of the account’s... | PCEX | classes, data structures, objects, stacks | |
| 16 | JSON Iterate 2 | Using JSON structure list codes for first three flights | jsParsons | json, json-iterate |