CodeIQ example code
- Code 1 : plot_normdist_pdf.py
- Implemented in Python 2.7
- Depends on scipy.stats and matplotlib
- This program is now a supplemental code not the answer code.
- Plot the pdf of two distributions (See command line option).
- Implemented in Python 2.7
- Code 1 : plot_tridist_pdf.py
- Implemented in Python 2.7
- Depends on scipy.stats and matplotlib
- This program is now a supplemental code not the answer code.
- Plot the pdf of the distributions (See command line option).
- Implemented in Python 2.7
- Code 1 : shortest_superstring.py
- Implemented in Python 2.7
- Depends on NetworkX and matplotlib
- This program is now a supplemental code not the answer code.
- Visualize the network diagram of the substrings (See command line option).
- Implemented in Python 2.7
-
Code 1 : word_chain.cpp
- Implemented in C++11
- Compiled with Visual Studio 2013 RC (VC12)
- This program can find <=32 word chain within about 1 second on modern PC.
- As for 33, the execute time might be about 30 seconds.
- However as for 34, the computation time will reach >100000 seconds !
- Finally as for 35, you will realize the meaning of 'combinational explosion' :-)
- Implemented in C++11
-
Code 2 : word_chain_optimized.cpp
- Improved version
- This program can find 35(=longest) word chain in only 1-3 seconds on modern PC.