|
| 1 | + |
| 2 | + |
| 3 | +# Practice Questions |
| 4 | +Sprint Archive: <a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/docs/ProblemSolvingSprints.md">Problem Solving Sprints</a> |
| 5 | + |
| 6 | + |
| 7 | +## Data Structures |
| 8 | + |
| 9 | +<table> |
| 10 | + <tr> |
| 11 | + <th><b>#</b></th> |
| 12 | + <th><b>Topic</b></th> |
| 13 | + <th><b>Difficulty</b></th> |
| 14 | + <th><b>Question</b></th> |
| 15 | + <th><b>Link</b></th> |
| 16 | + <th><b>Editorial</b></th> |
| 17 | + </tr> |
| 18 | + <tr> |
| 19 | + <td>1</td> |
| 20 | + <td>Linked List</td> |
| 21 | + <td>Easy</td> |
| 22 | + <td>Linked List Cycle</td> |
| 23 | + <td><a href="https://leetcode.com/problems/linked-list-cycle/">Link</a></td> |
| 24 | + <td></td> |
| 25 | + </tr> |
| 26 | + <tr> |
| 27 | + <td>2</td> |
| 28 | + <td>Linked List</td> |
| 29 | + <td>Easy</td> |
| 30 | + <td>Reverse Linked List</td> |
| 31 | + <td><a href="https://leetcode.com/problems/reverse-linked-list">Link</a></td> |
| 32 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/reverse-linked-list.cpp/">Editorial</a></td> |
| 33 | + </tr> |
| 34 | + <tr> |
| 35 | + <td>3</td> |
| 36 | + <td>Linked List</td> |
| 37 | + <td>Easy</td> |
| 38 | + <td>Palindrome Linked List</td> |
| 39 | + <td><a href="https://leetcode.com/problems/palindrome-linked-list/">Link</a></td> |
| 40 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/palindrome-linked-list.cpp/">Editorial</a></td> |
| 41 | + </tr> |
| 42 | + <tr> |
| 43 | + <td>4</td> |
| 44 | + <td>Linked List</td> |
| 45 | + <td>Medium</td> |
| 46 | + <td>Design Linked List</td> |
| 47 | + <td><a href="https://leetcode.com/problems/design-linked-list/">Link</a></td> |
| 48 | + <td></td> |
| 49 | + </tr> |
| 50 | + <tr> |
| 51 | + <td>5</td> |
| 52 | + <td>Linked List</td> |
| 53 | + <td>Medium</td> |
| 54 | + <td>Reorder List</td> |
| 55 | + <td><a href="https://leetcode.com/problems/reorder-list/">Link</a></td> |
| 56 | + <td></td> |
| 57 | + </tr> |
| 58 | + <tr> |
| 59 | + <td>6</td> |
| 60 | + <td>Linked List</td> |
| 61 | + <td>Medium</td> |
| 62 | + <td>Copy List with Random Pointer</td> |
| 63 | + <td><a href="https://leetcode.com/problems/copy-list-with-random-pointer/">Link</a></td> |
| 64 | + <td></td> |
| 65 | + </tr> |
| 66 | + <tr> |
| 67 | + <td>7</td> |
| 68 | + <td>Linked List</td> |
| 69 | + <td>Medium</td> |
| 70 | + <td>Add Two Numbers</td> |
| 71 | + <td><a href="https://leetcode.com/problems/add-two-numbers/">Link</a></td> |
| 72 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/add-two-numbers.cpp">Editorial</a></td> |
| 73 | + </tr> |
| 74 | + <tr> |
| 75 | + <td>8</td> |
| 76 | + <td>Stack</td> |
| 77 | + <td>Easy</td> |
| 78 | + <td>Valid Parentheses</td> |
| 79 | + <td><a href="https://leetcode.com/problems/valid-parentheses/">Link</a></td> |
| 80 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/valid-parentheses.cpp">Editorial</a></td> |
| 81 | + </tr> |
| 82 | + <tr> |
| 83 | + <td>9</td> |
| 84 | + <td>Stack</td> |
| 85 | + <td>Easy</td> |
| 86 | + <td>Backspace String Compare</td> |
| 87 | + <td><a href="https://leetcode.com/problems/backspace-string-compare/">Link</a></td> |
| 88 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/backspace-string-compare.cpp">Editorial</a></td> |
| 89 | + </tr> |
| 90 | + <tr> |
| 91 | + <td>10</td> |
| 92 | + <td>Stack</td> |
| 93 | + <td>Medium</td> |
| 94 | + <td>Min Stack</td> |
| 95 | + <td><a href="https://leetcode.com/problems/min-stack/">Link</a></td> |
| 96 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/min-stack.cpp">Editorial</a></td> |
| 97 | + </tr> |
| 98 | + <tr> |
| 99 | + <td>11</td> |
| 100 | + <td>Stack</td> |
| 101 | + <td>Medium</td> |
| 102 | + <td>Daily Temperatures</td> |
| 103 | + <td><a href="https://leetcode.com/problems/daily-temperatures/">Link</a></td> |
| 104 | + <td></td> |
| 105 | + </tr> |
| 106 | + <tr> |
| 107 | + <td>12</td> |
| 108 | + <td>Stack</td> |
| 109 | + <td>Medium</td> |
| 110 | + <td>Evaluate Reverse Polish Notation</td> |
| 111 | + <td><a href="https://leetcode.com/problems/evaluate-reverse-polish-notation/">Link</a></td> |
| 112 | + <td></td> |
| 113 | + </tr> |
| 114 | + <tr> |
| 115 | + <td>13</td> |
| 116 | + <td>Queue</td> |
| 117 | + <td>Easy</td> |
| 118 | + <td>Implement Queue using Stacks</td> |
| 119 | + <td><a href="https://leetcode.com/problems/implement-queue-using-stacks/">Link</a></td> |
| 120 | + <td></td> |
| 121 | + </tr> |
| 122 | + <tr> |
| 123 | + <td>14</td> |
| 124 | + <td>Queue</td> |
| 125 | + <td>Easy</td> |
| 126 | + <td>Implement Stack using Queues</td> |
| 127 | + <td><a href="https://leetcode.com/problems/implement-stack-using-queues/">Link</a></td> |
| 128 | + <td></td> |
| 129 | + </tr> |
| 130 | + <tr> |
| 131 | + <td>15</td> |
| 132 | + <td>Queue</td> |
| 133 | + <td></td> |
| 134 | + <td>Hungry ITU</td> |
| 135 | + <td><a href="https://www.hackerrank.com/contests/itu-acm-algo-101-contest-22-23/challenges/hungry-itu/problem">Link</a></td> |
| 136 | + <td></td> |
| 137 | + </tr> |
| 138 | + <tr> |
| 139 | + <td>16</td> |
| 140 | + <td>Priority Queue</td> |
| 141 | + <td>Easy</td> |
| 142 | + <td>Kth Largest Element in a Stream</td> |
| 143 | + <td><a href="https://leetcode.com/problems/kth-largest-element-in-a-stream">Link</a></td> |
| 144 | + <td><a href="https://github.com/ituacm/ITU-ACM-AlgoTeam/blob/main/Regular-Question-Answers/kth-largest-element-in-a-stream.cpp">Editorial</a></td> |
| 145 | + </tr> |
| 146 | + <tr> |
| 147 | + <td>17</td> |
| 148 | + <td>Priority Queue</td> |
| 149 | + <td>Medium</td> |
| 150 | + <td>Cheapest Flights Within K Stops</td> |
| 151 | + <td><a href="https://leetcode.com/problems/cheapest-flights-within-k-stops/">Link</a></td> |
| 152 | + <td></td> |
| 153 | + </tr> |
| 154 | + <tr> |
| 155 | + <td>18</td> |
| 156 | + <td>Priority Queue</td> |
| 157 | + <td>Medium</td> |
| 158 | + <td>K Closest Points to Origin</td> |
| 159 | + <td><a href="https://leetcode.com/problems/k-closest-points-to-origin/">Link</a></td> |
| 160 | + <td></td> |
| 161 | + </tr> |
| 162 | + |
0 commit comments