backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-30 16:51:57 +08:00
Code Issues Projects Releases Wiki Activity
Files
64028e7a1387c4a748072bba1ed98203c295d905
C-Plus-Plus/dir_8a20dd5bfd5341a725342bf72b6b686f.html
realstealthninja 38bae2522c Documentation for 145111cd7e
2025-08-15 09:27:02 +00:00

194 lines
23 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.12.0-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: dynamic_programming Directory Reference</title>
<link rel="icon" href="favicon.svg" type="image/x-icon" />
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('dir_8a20dd5bfd5341a725342bf72b6b686f.html','',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">dynamic_programming Directory Reference</div></div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-files" class="groupheader"><a id="files" name="files"></a>
Files</h2></td></tr>
<tr class="memitem:a0_5F1_5Fknapsack_2Ecpp" id="r_a0_5F1_5Fknapsack_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="db/d16/0__1__knapsack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d16/0__1__knapsack_8cpp.html">0_1_knapsack.cpp</a></td></tr>
<tr class="memdesc:db/d16/0__1__knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) <br /></td></tr>
<tr class="memitem:abbreviation_2Ecpp" id="r_abbreviation_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d73/abbreviation_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d73/abbreviation_8cpp.html">abbreviation.cpp</a></td></tr>
<tr class="memdesc:d7/d73/abbreviation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a> <br /></td></tr>
<tr class="memitem:armstrong_5Fnumber_5Ftemplated_2Ecpp" id="r_armstrong_5Fnumber_5Ftemplated_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d1/da7/armstrong__number__templated_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/da7/armstrong__number__templated_8cpp.html">armstrong_number_templated.cpp</a></td></tr>
<tr class="memdesc:d1/da7/armstrong__number__templated_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong Number</a> or not. <br /></td></tr>
<tr class="memitem:bellman_5Fford_2Ecpp" id="r_bellman_5Fford_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d14/bellman__ford_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>bellman_ford.cpp</b></td></tr>
<tr class="memitem:catalan_5Fnumbers_2Ecpp" id="r_catalan_5Fnumbers_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/dd9/catalan__numbers_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd9/catalan__numbers_8cpp.html">catalan_numbers.cpp</a></td></tr>
<tr class="memdesc:de/dd9/catalan__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: <a href="https://en.wikipedia.org/wiki/Catalan_number">https://en.wikipedia.org/wiki/Catalan_number</a> <a href="https://oeis.org/A000108/">https://oeis.org/A000108/</a>. <br /></td></tr>
<tr class="memitem:coin_5Fchange_2Ecpp" id="r_coin_5Fchange_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d6b/coin__change_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>coin_change.cpp</b></td></tr>
<tr class="memitem:coin_5Fchange_5Ftopdown_2Ecpp" id="r_coin_5Fchange_5Ftopdown_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d31/coin__change__topdown_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d31/coin__change__topdown_8cpp.html">coin_change_topdown.cpp</a></td></tr>
<tr class="memdesc:d9/d31/coin__change__topdown_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/coin-change/" target="_blank">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount. <br /></td></tr>
<tr class="memitem:cut_5Frod_2Ecpp" id="r_cut_5Frod_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d6/d10/cut__rod_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d10/cut__rod_8cpp.html">cut_rod.cpp</a></td></tr>
<tr class="memdesc:d6/d10/cut__rod_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of cutting a rod problem. <br /></td></tr>
<tr class="memitem:edit_5Fdistance_2Ecpp" id="r_edit_5Fdistance_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d5/d82/edit__distance_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>edit_distance.cpp</b></td></tr>
<tr class="memitem:egg_5Fdropping_5Fpuzzle_2Ecpp" id="r_egg_5Fdropping_5Fpuzzle_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/d7d/egg__dropping__puzzle_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>egg_dropping_puzzle.cpp</b></td></tr>
<tr class="memitem:fibonacci_5Fbottom_5Fup_2Ecpp" id="r_fibonacci_5Fbottom_5Fup_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d1/d7c/fibonacci__bottom__up_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>fibonacci_bottom_up.cpp</b></td></tr>
<tr class="memitem:floyd_5Fwarshall_2Ecpp" id="r_floyd_5Fwarshall_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="df/d31/floyd__warshall_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>floyd_warshall.cpp</b></td></tr>
<tr class="memitem:house_5Frobber_2Ecpp" id="r_house_5Frobber_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d6/d26/house__robber_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d26/house__robber_8cpp.html">house_robber.cpp</a></td></tr>
<tr class="memdesc:d6/d26/house__robber_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm. <br /></td></tr>
<tr class="memitem:kadane_2Ecpp" id="r_kadane_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d4/da0/kadane_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/kadane_8cpp.html">kadane.cpp</a></td></tr>
<tr class="memdesc:d4/da0/kadane_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> <br /></td></tr>
<tr class="memitem:longest_5Fcommon_5Fstring_2Ecpp" id="r_longest_5Fcommon_5Fstring_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d0d/longest__common__string_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></td></tr>
<tr class="memdesc:da/d0d/longest__common__string_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">contains the definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> <br /></td></tr>
<tr class="memitem:longest_5Fcommon_5Fsubsequence_2Ecpp" id="r_longest_5Fcommon_5Fsubsequence_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d4/def/longest__common__subsequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>longest_common_subsequence.cpp</b></td></tr>
<tr class="memitem:longest_5Fincreasing_5Fsubsequence_2Ecpp" id="r_longest_5Fincreasing_5Fsubsequence_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d57/longest__increasing__subsequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html">longest_increasing_subsequence.cpp</a></td></tr>
<tr class="memdesc:d7/d57/longest__increasing__subsequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array. <br /></td></tr>
<tr class="memitem:longest_5Fincreasing_5Fsubsequence_5Fnlogn_2Ecpp" id="r_longest_5Fincreasing_5Fsubsequence_5Fnlogn_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>longest_increasing_subsequence_nlogn.cpp</b></td></tr>
<tr class="memitem:longest_5Fpalindromic_5Fsubsequence_2Ecpp" id="r_longest_5Fpalindromic_5Fsubsequence_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d0/d77/longest__palindromic__subsequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html">longest_palindromic_subsequence.cpp</a></td></tr>
<tr class="memdesc:d0/d77/longest__palindromic__subsequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string. <br /></td></tr>
<tr class="memitem:matrix_5Fchain_5Fmultiplication_2Ecpp" id="r_matrix_5Fchain_5Fmultiplication_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d2/da2/matrix__chain__multiplication_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>matrix_chain_multiplication.cpp</b></td></tr>
<tr class="memitem:maximum_5Fcircular_5Fsubarray_2Ecpp" id="r_maximum_5Fcircular_5Fsubarray_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="db/dfb/maximum__circular__subarray_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html">maximum_circular_subarray.cpp</a></td></tr>
<tr class="memdesc:db/dfb/maximum__circular__subarray_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> <br /></td></tr>
<tr class="memitem:minimum_5Fedit_5Fdistance_2Ecpp" id="r_minimum_5Fedit_5Fdistance_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d52/minimum__edit__distance_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d52/minimum__edit__distance_8cpp.html">minimum_edit_distance.cpp</a></td></tr>
<tr class="memdesc:da/d52/minimum__edit__distance_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing. <br /></td></tr>
<tr class="memitem:palindrome_5Fpartitioning_2Ecpp" id="r_palindrome_5Fpartitioning_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d5/d90/palindrome__partitioning_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html">palindrome_partitioning.cpp</a></td></tr>
<tr class="memdesc:d5/d90/palindrome__partitioning_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make. <br /></td></tr>
<tr class="memitem:partition_5Fproblem_2Ecpp" id="r_partition_5Fproblem_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d8c/partition__problem_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>partition_problem.cpp</b></td></tr>
<tr class="memitem:searching_5Fof_5Felement_5Fin_5Fdynamic_5Farray_2Ecpp" id="r_searching_5Fof_5Felement_5Fin_5Fdynamic_5Farray_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="da/d68/searching__of__element__in__dynamic__array_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>searching_of_element_in_dynamic_array.cpp</b></td></tr>
<tr class="memitem:shortest_5Fcommon_5Fsupersequence_2Ecpp" id="r_shortest_5Fcommon_5Fsupersequence_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d7/d65/shortest__common__supersequence_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html">shortest_common_supersequence.cpp</a></td></tr>
<tr class="memdesc:d7/d65/shortest__common__supersequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained). <br /></td></tr>
<tr class="memitem:subset_5Fsum_5Fdynamic_2Ecpp" id="r_subset_5Fsum_5Fdynamic_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="dc/d67/subset__sum__dynamic_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d67/subset__sum__dynamic_8cpp.html">subset_sum_dynamic.cpp</a></td></tr>
<tr class="memdesc:dc/d67/subset__sum__dynamic_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not. <br /></td></tr>
<tr class="memitem:trapped_5Frainwater_2Ecpp" id="r_trapped_5Frainwater_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/d80/trapped__rainwater_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d80/trapped__rainwater_8cpp.html">trapped_rainwater.cpp</a></td></tr>
<tr class="memdesc:d9/d80/trapped__rainwater_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> <br /></td></tr>
<tr class="memitem:trapped_5Frainwater2_2Ecpp" id="r_trapped_5Frainwater2_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d4/de3/trapped__rainwater2_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/de3/trapped__rainwater2_8cpp.html">trapped_rainwater2.cpp</a></td></tr>
<tr class="memdesc:d4/de3/trapped__rainwater2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> <br /></td></tr>
<tr class="memitem:tree_5Fheight_2Ecpp" id="r_tree_5Fheight_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="de/d77/tree__height_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>tree_height.cpp</b></td></tr>
<tr class="memitem:unbounded_5F0_5F1_5Fknapsack_2Ecpp" id="r_unbounded_5F0_5F1_5Fknapsack_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d9/dec/unbounded__0__1__knapsack_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.cpp</a></td></tr>
<tr class="memdesc:d9/dec/unbounded__0__1__knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem. <br /></td></tr>
<tr class="memitem:word_5Fbreak_2Ecpp" id="r_word_5Fbreak_2Ecpp"><td class="memItemLeft" align="right" valign="top"><a href="d3/d84/word__break_8cpp_source.html"><span class="icondoc"><div class="doc-icon"></div></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d84/word__break_8cpp.html">word_break.cpp</a></td></tr>
<tr class="memdesc:d3/d84/word__break_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> <br /></td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink