mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-12-12 22:57:06 +03:00
Code Issues Packages Projects Releases Wiki Activity

Documentation for 7aba094afb

Browse Source
This commit is contained in:
github-actions 2022-11-25 05:17:20 +00:00
parent 9ee61d74e5
commit a625de29fb
9 changed files with 97 additions and 98 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
d0/d6c/problem__4_2sol_8c.html
View File

@ -182,22 +182,21 @@ Functions</h2></td></tr>
<p>Main function. </p>
<div class="fragment"><div class="line"><span class="lineno"> 26</span>{</div>
<div class="line"><span class="lineno"> 27</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, j, <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = 0;</div>
<div class="line"><span class="lineno"> 27</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, j, max = 0;</div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">for</span> (i = 100; i &lt;= 999; i++)</div>
<div class="line"><span class="lineno"> 29</span> {</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">for</span> (j = 100; j &lt;= 999; j++)</div>
<div class="line"><span class="lineno"> 31</span> {</div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> p = i * j;</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4">is_palindromic</a>(p) &amp;&amp; p &gt; <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>)</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4">is_palindromic</a>(p) &amp;&amp; p &gt; max)</div>
<div class="line"><span class="lineno"> 34</span> {</div>
<div class="line"><span class="lineno"> 35</span> <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = p;</div>
<div class="line"><span class="lineno"> 35</span> max = p;</div>
<div class="line"><span class="lineno"> 36</span> }</div>
<div class="line"><span class="lineno"> 37</span> }</div>
<div class="line"><span class="lineno"> 38</span> }</div>
<div class="line"><span class="lineno"> 39</span> printf(<span class="stringliteral">&quot;%u\n&quot;</span>, <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>);</div>
<div class="line"><span class="lineno"> 39</span> printf(<span class="stringliteral">&quot;%u\n&quot;</span>, max);</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 41</span>}</div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="aproblem__4_2sol_8c_html_adf9bea8d35848959bde5b3f277edf0c4"><div class="ttname"><a href="../../d0/d6c/problem__4_2sol_8c.html#adf9bea8d35848959bde5b3f277edf0c4">is_palindromic</a></div><div class="ttdeci">int is_palindromic(unsigned int n)</div><div class="ttdoc">Check if number is palindromic.</div><div class="ttdef"><b>Definition:</b> sol.c:12</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>

9
d0/df3/6_8c.html
View File

@ -187,8 +187,8 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> out;</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><span class="lineno"> 44</span> </div>
<div class="line"><span class="lineno"> 45</span> uint16_t <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = numRows - 1;</div>
<div class="line"><span class="lineno"> 46</span> uint16_t rr = 2 * <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>;</div>
<div class="line"><span class="lineno"> 45</span> uint16_t max = numRows - 1;</div>
<div class="line"><span class="lineno"> 46</span> uint16_t rr = 2 * max;</div>
<div class="line"><span class="lineno"> 47</span> uint16_t i = 0;</div>
<div class="line"><span class="lineno"> 48</span> uint16_t o = 0;</div>
<div class="line"><span class="lineno"> 49</span> uint16_t delta = 0;</div>
@ -201,7 +201,7 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="line"><span class="lineno"> 57</span> </div>
<div class="line"><span class="lineno"> 58</span> <span class="comment">// middle rows</span></div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">for</span> (uint16_t l = 1; l &lt; <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>; l++)</div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">for</span> (uint16_t l = 1; l &lt; max; l++)</div>
<div class="line"><span class="lineno"> 60</span> {</div>
<div class="line"><span class="lineno"> 61</span> i = l;</div>
<div class="line"><span class="lineno"> 62</span> delta = 2 * l;</div>
@ -214,7 +214,7 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="line"><span class="lineno"> 70</span> </div>
<div class="line"><span class="lineno"> 71</span> <span class="comment">// last row</span></div>
<div class="line"><span class="lineno"> 72</span> i = <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>;</div>
<div class="line"><span class="lineno"> 72</span> i = max;</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">while</span> (i &lt; len)</div>
<div class="line"><span class="lineno"> 74</span> {</div>
<div class="line"><span class="lineno"> 75</span> out[o++] = in[i];</div>
@ -223,7 +223,6 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 78</span> </div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> out;</div>
<div class="line"><span class="lineno"> 80</span>}</div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_afdddaa949a93c1ef559a638e98f9c21b"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a></div><div class="ttdeci">#define calloc(elemCount, elemSize)</div><div class="ttdoc">This macro replace the standard calloc function with calloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:22</div></div>
</div><!-- fragment -->
</div>

2
d2/da8/bead__sort_8c.html
View File

@ -118,7 +118,7 @@ Include dependency graph for bead_sort.c:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memItemLeft" align="right" valign="top">
#define&#160;</td><td class="memItemRight" valign="bottom"><b>BEAD</b>(i, j)&#160;&#160;&#160;beads[i * <a class="el" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> + j]</td></tr>
#define&#160;</td><td class="memItemRight" valign="bottom"><b>BEAD</b>(i, j)&#160;&#160;&#160;beads[i * max + j]</td></tr>
<tr class="memdesc:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create easy access of elements from a 2D matrix stored in memory as a 1D array. <br /></td></tr>
<tr class="separator:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">

17
d5/d4c/group__sorting.html
View File

@ -107,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d4c/group__sorting.html','../../');
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
Macros</h2></td></tr>
<tr class="memitem:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memItemLeft" align="right" valign="top"><a id="ga4fdb8af29a07ac8f496e49a11bf9f1bd" name="ga4fdb8af29a07ac8f496e49a11bf9f1bd"></a>
#define&#160;</td><td class="memItemRight" valign="bottom"><b>BEAD</b>(i, j)&#160;&#160;&#160;beads[i * <a class="el" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> + j]</td></tr>
#define&#160;</td><td class="memItemRight" valign="bottom"><b>BEAD</b>(i, j)&#160;&#160;&#160;beads[i * max + j]</td></tr>
<tr class="memdesc:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create easy access of elements from a 2D matrix stored in memory as a 1D array. <br /></td></tr>
<tr class="separator:ga4fdb8af29a07ac8f496e49a11bf9f1bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@ -175,20 +175,20 @@ Functions</h2></td></tr>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 38</span>{</div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> i, j, <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>, sum;</div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> i, j, max, sum;</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *beads;</div>
<div class="line"><span class="lineno"> 41</span> </div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (i = 1, <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = a[0]; i &lt; len; i++)</div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">if</span> (a[i] &gt; <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>)</div>
<div class="line"><span class="lineno"> 44</span> <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> = a[i];</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (i = 1, max = a[0]; i &lt; len; i++)</div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">if</span> (a[i] &gt; max)</div>
<div class="line"><span class="lineno"> 44</span> max = a[i];</div>
<div class="line"><span class="lineno"> 45</span> </div>
<div class="line"><span class="lineno"> 46</span> beads = <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(1, <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> * len);</div>
<div class="line"><span class="lineno"> 46</span> beads = <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a>(1, max * len);</div>
<div class="line"><span class="lineno"> 47</span> </div>
<div class="line"><span class="lineno"> 48</span> <span class="comment">/* mark the beads */</span></div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">for</span> (i = 0; i &lt; len; i++)</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">for</span> (j = 0; j &lt; a[i]; j++) <a class="code hl_define" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j) = 1;</div>
<div class="line"><span class="lineno"> 51</span> </div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">for</span> (j = 0; j &lt; <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a>; j++)</div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">for</span> (j = 0; j &lt; max; j++)</div>
<div class="line"><span class="lineno"> 53</span> {</div>
<div class="line"><span class="lineno"> 54</span> <span class="comment">/* count how many beads are on each post */</span></div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">for</span> (sum = i = 0; i &lt; len; i++)</div>
@ -202,13 +202,12 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 63</span> </div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (i = 0; i &lt; len; i++)</div>
<div class="line"><span class="lineno"> 65</span> {</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">for</span> (j = 0; j &lt; <a class="code hl_define" href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a> &amp;&amp; <a class="code hl_define" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j); j++)</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">for</span> (j = 0; j &lt; max &amp;&amp; <a class="code hl_define" href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a>(i, j); j++)</div>
<div class="line"><span class="lineno"> 67</span> ;</div>
<div class="line"><span class="lineno"> 68</span> a[i] = j;</div>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="line"><span class="lineno"> 70</span> <a class="code hl_define" href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a>(beads);</div>
<div class="line"><span class="lineno"> 71</span>}</div>
<div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
<div class="ttc" id="agroup__sorting_html_ga4fdb8af29a07ac8f496e49a11bf9f1bd"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga4fdb8af29a07ac8f496e49a11bf9f1bd">BEAD</a></div><div class="ttdeci">#define BEAD(i, j)</div><div class="ttdoc">Create easy access of elements from a 2D matrix stored in memory as a 1D array.</div><div class="ttdef"><b>Definition:</b> bead_sort.c:16</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_a9cc854374299a1dd933bf62029761768"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#a9cc854374299a1dd933bf62029761768">free</a></div><div class="ttdeci">#define free(ptr)</div><div class="ttdoc">This macro replace the standard free function with free_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:26</div></div>
<div class="ttc" id="amalloc__dbg_8h_html_afdddaa949a93c1ef559a638e98f9c21b"><div class="ttname"><a href="../../d2/ddd/malloc__dbg_8h.html#afdddaa949a93c1ef559a638e98f9c21b">calloc</a></div><div class="ttdeci">#define calloc(elemCount, elemSize)</div><div class="ttdoc">This macro replace the standard calloc function with calloc_dbg.</div><div class="ttdef"><b>Definition:</b> malloc_dbg.h:22</div></div>

146
d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
View File

@ -150,150 +150,152 @@ LeetCode Algorithm</h2>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">38 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/count-and-say/" target="_blank">Count and Say</a> </td><td class="markdownTableBodyNone"><a href="../.././src/38.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">42 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/trapping-rain-water/" target="_blank">Trapping Rain Water</a> </td><td class="markdownTableBodyNone"><a href="../.././src/42.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">53 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-subarray/" target="_blank">Maximum Subarray</a> </td><td class="markdownTableBodyNone"><a href="../.././src/53.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">62 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/unique-paths/description/" target="_blank">Unique Paths</a> </td><td class="markdownTableBodyNone"><a href="../.././src/62.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">66 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/plus-one/" target="_blank">Plus One</a> </td><td class="markdownTableBodyNone"><a href="../.././src/66.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">82 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/" target="_blank">Remove Duplicates from Sorted List II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/82.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">83 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-duplicates-from-sorted-list/" target="_blank">Remove Duplicates from Sorted List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/83.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">94 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-tree-inorder-traversal/" target="_blank">Binary Tree Inorder Traversal</a> </td><td class="markdownTableBodyNone"><a href="../.././src/94.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">101 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/symmetric-tree/" target="_blank">Symmetric Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/101.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">104 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-depth-of-binary-tree/" target="_blank">Maximum Depth of Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/104.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">108 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/" target="_blank">Convert Sorted Array to Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/108.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">109 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/" target="_blank">Convert Sorted List to Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/109.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">110 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/balanced-binary-tree/" target="_blank">Balanced Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/110.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">112 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/path-sum/" target="_blank">Path Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/112.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">118 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/pascals-triangle/" target="_blank">Pascal's Triangle</a> </td><td class="markdownTableBodyNone"><a href="../.././src/118.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">121 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/best-time-to-buy-and-sell-stock/" target="_blank">Best Time to Buy and Sell Stock</a> </td><td class="markdownTableBodyNone"><a href="../.././src/121.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">125 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-palindrome/" target="_blank">Valid Palindrome</a> </td><td class="markdownTableBodyNone"><a href="../.././src/125.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">136 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/single-number/" target="_blank">Single Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/136.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">141 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/linked-list-cycle/" target="_blank">Linked List Cycle</a> </td><td class="markdownTableBodyNone"><a href="../.././src/141.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">142 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/linked-list-cycle-ii/" target="_blank">Linked List Cycle II</a> </td><td class="markdownTableBodyNone"><a href="../.././src/142.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">153 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/" target="_blank">Find Minimum in Rotated Sorted Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/153.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">160 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/intersection-of-two-linked-lists/" target="_blank">Intersection of Two Linked Lists</a> </td><td class="markdownTableBodyNone"><a href="../.././src/160.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">169 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/majority-element/" target="_blank">Majority Element</a> </td><td class="markdownTableBodyNone"><a href="../.././src/169.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">173 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-search-tree-iterator/" target="_blank">Binary Search Tree Iterator</a> </td><td class="markdownTableBodyNone"><a href="../.././src/173.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">189 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/rotate-array" target="_blank">Rotate Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/189.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">190 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-bits/" target="_blank">Reverse Bits</a> </td><td class="markdownTableBodyNone"><a href="../.././src/190.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">191 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-1-bits/" target="_blank">Number of 1 Bits</a> </td><td class="markdownTableBodyNone"><a href="../.././src/191.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">201 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/bitwise-and-of-numbers-range/" target="_blank">Bitwise AND of Numbers Range</a> </td><td class="markdownTableBodyNone"><a href="../.././src/201.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">203 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/remove-linked-list-elements/" target="_blank">Remove Linked List Elements</a> </td><td class="markdownTableBodyNone"><a href="../.././src/203.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">206 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-linked-list/" target="_blank">Reverse Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/206.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">215 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/kth-largest-element-in-an-array/" target="_blank">Kth Largest Element in an Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/215.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">217 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/contains-duplicate/" target="_blank">Contains Duplicate</a> </td><td class="markdownTableBodyNone"><a href="../.././src/217.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">223 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/rectangle-area/" target="_blank">Rectangle Area</a> </td><td class="markdownTableBodyNone"><a href="../.././src/223.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">226 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/invert-binary-tree/" target="_blank">Invert Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/226.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">231 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/power-of-two/" target="_blank">Power of Two</a> </td><td class="markdownTableBodyNone"><a href="../.././src/231.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">234 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/palindrome-linked-list/" target="_blank">Palindrome Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/234.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">242 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-anagram/" target="_blank">Valid Anagram</a> </td><td class="markdownTableBodyNone"><a href="../.././src/242.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">268 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/missing-number/" target="_blank">Missing Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/268.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">278 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/first-bad-version/" target="_blank">First Bad Version</a> </td><td class="markdownTableBodyNone"><a href="../.././src/278.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">283 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/move-zeroes/" target="_blank">Move Zeroes</a> </td><td class="markdownTableBodyNone"><a href="../.././src/283.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">287 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-duplicate-number/" target="_blank">Find the Duplicate Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/287.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">344 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-string/" target="_blank">Reverse String</a> </td><td class="markdownTableBodyNone"><a href="../.././src/344.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">367 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/valid-perfect-square/" target="_blank">Valid Perfect Square</a> </td><td class="markdownTableBodyNone"><a href="../.././src/367.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">387 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/first-unique-character-in-a-string/" target="_blank">First Unique Character in a String</a> </td><td class="markdownTableBodyNone"><a href="../.././src/387.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">389 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-difference/" target="_blank">Find the Difference</a> </td><td class="markdownTableBodyNone"><a href="../.././src/389.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">404 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sum-of-left-leaves/" target="_blank">Sum of Left Leaves</a> </td><td class="markdownTableBodyNone"><a href="../.././src/404.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">442 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-all-duplicates-in-an-array/" target="_blank">Find All Duplicates in an Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/442.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">461 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/hamming-distance/" target="_blank">Hamming Distance</a> </td><td class="markdownTableBodyNone"><a href="../.././src/461.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">476 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-complement/" target="_blank">Number Complement</a> </td><td class="markdownTableBodyNone"><a href="../.././src/476.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">509 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/fibonacci-number/" target="_blank">Fibonacci Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/509.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">520 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/detect-capital/" target="_blank">Detect Capital</a> </td><td class="markdownTableBodyNone"><a href="../.././src/520.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">561 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/array-partition-i/" target="_blank">Array Partition I</a> </td><td class="markdownTableBodyNone"><a href="../.././src/561.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">617 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/merge-two-binary-trees/" target="_blank">Merge Two Binary Trees</a> </td><td class="markdownTableBodyNone"><a href="../.././src/617.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">647 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/palindromic-substrings/" target="_blank">Palindromic Substring</a> </td><td class="markdownTableBodyNone"><a href="../.././src/647.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">674 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-continuous-increasing-subsequence/" target="_blank">Longest Continuous Increasing Subsequence</a> </td><td class="markdownTableBodyNone"><a href="../.././src/674.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">700 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/search-in-a-binary-search-tree/" target="_blank">Search in a Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/700.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">701 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/insert-into-a-binary-search-tree/" target="_blank">Insert into a Binary Search Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/701.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">704 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/binary-search/" target="_blank">Binary Search</a> </td><td class="markdownTableBodyNone"><a href="../.././src/704.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">709 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/to-lower-case/" target="_blank">To Lower Case</a> </td><td class="markdownTableBodyNone"><a href="../.././src/709.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">771 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/jewels-and-stones/" target="_blank">Jewels and Stones</a> </td><td class="markdownTableBodyNone"><a href="../.././src/771.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">852 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/peak-index-in-a-mountain-array/" target="_blank">Peak Index in a Mountain Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/852.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">876 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/middle-of-the-linked-list/" target="_blank">Middle of the Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/876.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">905 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/sort-array-by-parity/" target="_blank">Sort Array By Parity</a> </td><td class="markdownTableBodyNone"><a href="../.././src/905.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">917 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/reverse-only-letters/" target="_blank">Reverse Only Letters</a> </td><td class="markdownTableBodyNone"><a href="../.././src/917.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">938 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/range-sum-of-bst/" target="_blank">Range Sum of BST</a> </td><td class="markdownTableBodyNone"><a href="../.././src/938.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">965 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/univalued-binary-tree/" target="_blank">Univalued Binary Tree</a> </td><td class="markdownTableBodyNone"><a href="../.././src/965.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">977 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/squares-of-a-sorted-array/" target="_blank">Squares of a Sorted Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/977.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1009 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/complement-of-base-10-integer/" target="_blank">Complement of Base 10 Integer</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1009.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1089 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/duplicate-zeros/" target="_blank">Duplicate Zeros</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1089.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1184 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/distance-between-bus-stops/" target="_blank">Distance Between Bus Stops</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1184.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1189 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-number-of-balloons/" target="_blank">Maximum Number of Balloons</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1189.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1207 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/unique-number-of-occurrences/" target="_blank">Unique Number of Occurrences</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1207.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1524 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/" target="_blank">Number of Sub-arrays With Odd Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1524.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1752 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/" target="_blank">Check if Array Is Sorted and Rotated</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1752.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<td class="markdownTableBodyNone">1524 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/" target="_blank">Number of Sub-arrays With Odd Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1524.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1752 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/" target="_blank">Check if Array Is Sorted and Rotated</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1752.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2130 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/" target="_blank">Maximum Twin Sum of a Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2130.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
</table>
</div></div><!-- contents -->

2
globals_func_i.html
View File

@ -119,8 +119,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>isEmpty()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">infix_to_postfix2.c</a></li>
<li>isOprnd()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b">infix_to_postfix.c</a></li>
<li>isPalindrome()&#160;:&#160;<a class="el" href="df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">palindrome.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isStrong()&#160;:&#160;<a class="el" href="d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">strong_number.c</a></li>
</ul>
</div><!-- contents -->

2
globals_i.html
View File

@ -120,8 +120,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>isEmpty()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">infix_to_postfix2.c</a></li>
<li>isOprnd()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b">infix_to_postfix.c</a></li>
<li>isPalindrome()&#160;:&#160;<a class="el" href="df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">palindrome.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isStrong()&#160;:&#160;<a class="el" href="d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">strong_number.c</a></li>
</ul>
</div><!-- contents -->

4
search/all_b.js
View File

@ -27,7 +27,7 @@ var searchData=
['isempty_24',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_25',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_26',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_27',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_28',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_27',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_28',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isstrong_29',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

4
search/functions_9.js
View File

@ -19,7 +19,7 @@ var searchData=
['isempty_16',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_17',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_18',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_19',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_20',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_19',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_20',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];