├── 1. Placement Guide.pdf
├── 2. CP Handbook.pdf
├── 3. 450QuestionsByLoveBabbar.xlsx
├── 4. CSE CORE IMPORTANT.pdf
├── Dynamic Programming
    ├── LIS.txt
    ├── Maximal Square.md
    ├── Maximum Sum Increasing Subsequence.md
    └── ques-solutions.md
├── LICENSE
├── README.md
└── TUF.pdf


/1. Placement Guide.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Anupriya1729/JobPrep/a915c13f1303eb5daea0d33317d4a1c34e1097b2/1. Placement Guide.pdf


--------------------------------------------------------------------------------
/2. CP Handbook.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Anupriya1729/JobPrep/a915c13f1303eb5daea0d33317d4a1c34e1097b2/2. CP Handbook.pdf


--------------------------------------------------------------------------------
/3. 450QuestionsByLoveBabbar.xlsx:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Anupriya1729/JobPrep/a915c13f1303eb5daea0d33317d4a1c34e1097b2/3. 450QuestionsByLoveBabbar.xlsx


--------------------------------------------------------------------------------
/4. CSE CORE IMPORTANT.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Anupriya1729/JobPrep/a915c13f1303eb5daea0d33317d4a1c34e1097b2/4. CSE CORE IMPORTANT.pdf


--------------------------------------------------------------------------------
/Dynamic Programming/LIS.txt:
--------------------------------------------------------------------------------
  1 | // Longest Increasing Subsequence (LIS)
  2 | 
  3 | Method 1:
  4 | Brute Force
  5 | 
  6 | Idea: Consider all the subsequences, find the increasing ones, then find the one with maximum length
  7 | Time Complexity: exponential
  8 | Every element has 2 choices -> consider it, don't consider it
  9 | i.e O(2^n)
 10 | 
 11 | Method 2:
 12 | Dynamic Programming
 13 | 
 14 | Idea:
 15 | Find the LIS ending with very element.
 16 | Since, we are palying with 1 parameter only i.e. length
 17 | So, it will be a 1-D DP
 18 | 
 19 | 	example:
 20 | 	{ 3, 4, 2, 8, 10 }
 21 | 	  0  1  2  3  4
 22 | 
 23 |    dp[] : 1  1  1  1  1 --> each number is a subsequence itself
 24 | 	  1  2  1  1  1 --> add 1 to the current cell if this can extend the previous sequence otherwise do nothing
 25 | 	  1  2  1  1  1
 26 | 	  1  2  1  3  1
 27 | 	  1  2  1  3  4 --> maximum of all these values will give the result
 28 | 	
 29 | TIME COMPLEXITY: O(n^2)
 30 | SPACE COMPLEXITY: O(n)
 31 | 	
 32 | #include <iostream>
 33 | using namespace std;
 34 | 
 35 | int LIS(vector<int> &input)
 36 | {
 37 | 	int n= input.size();
 38 | 	if(n==0)
 39 | 	{
 40 | 		return 0;
 41 | 	}
 42 | 	int dp[n];
 43 | 	dp[0]=1;
 44 | 	for(int i=1;i<n;i++)
 45 | 	{
 46 | 		for(int j=0;j<i;j++)
 47 | 		{
 48 | 			if(input[i]>input[j])
 49 | 			{
 50 | 				dp[i]=max(dp[i],1+dp[j])
 51 | 			}
 52 | 		}
 53 | 	}
 54 | 	int length_of_lis=0;
 55 | 	for(int i=0;i<n;i++)
 56 | 	{
 57 | 		length_of_lis=max(length_of_lis,dp[i]);
 58 | 	}
 59 | 	
 60 | 	return length_of_lis;
 61 | }
 62 | 
 63 | 
 64 | METHOD 3:
 65 | 
 66 | Using greedy+binary search concept
 67 | Let's imagine our array as deck of cards.
 68 | 2 5 3 4
 69 | in the above case if we choose 2 then 5 then we won't be able to choose the next numbers which won't be beneficial for us.
 70 | If we choose 3 instead then we can add 4 on the top of it to create an increasing subsequence.
 71 | 
 72 | Idea:
 73 | iterate over the array
 74 | if current element is greater than the element of top then push it to the array
 75 | If it is not then find then replace the current top with the element greater than it.
 76 | this can be done by finding the index of such an element using binary search or if allowed then you can use "lower_bound" (STL)
 77 | 
 78 | TIME COMPLEXITY: O(n log n)
 79 | SPACE: O(n)
 80 | 
 81 | int LIS(vector<int> &input)
 82 | {
 83 | 	int n= input.size();
 84 | 	if(n==0)
 85 | 	{
 86 | 		return 0;
 87 | 	}
 88 | 	vector<int> lis;
 89 | 	lis.push_back(input[0]);
 90 | 	for(int i=1;i<n;i++)
 91 | 	{
 92 | 		if(input.back()<input[i])
 93 | 		{
 94 | 			lis.push_back(input[i]);
 95 | 		}
 96 | 		else
 97 | 		{
 98 | 			int ind= lower_bound(lis.begin(),lis.end(),input[i])-lis.begin();
 99 | 			lis[ind]=n input[i];
100 | 		}
101 | 	}
102 | 	
103 | 	return lis.size();
104 | }
105 | 
106 | 


--------------------------------------------------------------------------------
/Dynamic Programming/Maximal Square.md:
--------------------------------------------------------------------------------
 1 | Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
 2 | 
 3 | Problem Link: <a href="https://leetcode.com/problems/maximal-square/">https://leetcode.com/problems/maximal-square/</a>
 4 | <pre>
 5 | Explanation:
 6 | Maximal Square --> optimization problem
 7 | DP
 8 | properties: 
 9 | Overlapping subproblems --> 
10 | Optimal Substructure
11 |  
12 | Property of a square:
13 | Length of row col and diagonal is same.
14 | 	
15 | DP can only be applied if we use previously calculated solutions to build the current solution.
16 | We need to look at 3 directions in our dp array:
17 | 		      \ |
18 | 	            ___\|
19 | find minimum in all three directions.--> this is done because if any of them is zero then min will be 0 which will imply that square cannot be extended.
20 | to check whether by adding current 1 can be extend the size of existing submatrix.  
21 |   -> we do it by looking at the min of
22 |      vertical length , horizontal length, diagonal length 
23 |     
24 | We maintain a variable to keep track of largest square edge till now.
25 | 
26 | arr                dp array
27 |  1 0 1 0 0         1 0 1 0 0
28 |  1 0 1 1 1    -->  1 0 1 1 1
29 |  1 1 1 1 1         1 1 1 2 2
30 |  1 0 0 1 0         1 0 0 1 0
31 | 
32 | 
33 | largest  --> to keep track of the largest  till now
34 | at the end largest will store 2 --> which is the edge length of square, since we need area so we return largest* largest
35 | 
36 | 
37 | Time : O(mn)
38 | Space : O(mn) --> it can be optimised by using BINARY INDEXING
39 |                     because we actually need only 2 rows
40 |                     O(m) after optimization
41 | </pre>
42 | Solution:
43 | <a href="https://ideone.com/SXdqmO">https://ideone.com/SXdqmO</a>
44 | 


--------------------------------------------------------------------------------
/Dynamic Programming/Maximum Sum Increasing Subsequence.md:
--------------------------------------------------------------------------------
 1 | This Question is a variation of LIS problem all we need to do is take sum as a criteria instead of length.
 2 | Visit that problem first before moving to this question.
 3 | 
 4 | <pre>
 5 | Sample Input:
 6 | {1, 4 , 3 , 0, 100, 2 , 1}
 7 | Output: 
 8 | 1 4 100 --> 105
 9 | 
10 | Sample Input:
11 | {1, 4 , 3 , 0, 100, 2 , 1}
12 | Output: 
13 | 105
14 | 
15 | Sample Input:
16 | {1, 2 , 3 , 5}
17 | Output: 
18 | 11
19 | 
20 | Sample Input:
21 | {5,4,2,0}
22 | Output: 
23 | 5
24 | </pre>
25 | <pre>
26 | Solution: <a href="https://ideone.com/dIpCi0">https://ideone.com/dIpCi0</a>
27 | </pre>
28 | 


--------------------------------------------------------------------------------
/Dynamic Programming/ques-solutions.md:
--------------------------------------------------------------------------------
 1 | https://leetcode.com/problems/min-cost-climbing-stairs/discuss/476388/4-ways-or-Step-by-step-from-Recursion-greater-top-down-DP-greater-bottom-up-DP-greater-fine-tuning
 2 | 
 3 | Questions-<br>
 4 | 1. Fibonacci<br>
 5 | 2. Divisor Game<br>
 6 | 3. Min Cost to Climb<br>
 7 | 	https://leetcode.com/problems/min-cost-climbing-stairs/submissions/ <br>
 8 | 4. Number of ways to climb stairs <br>
 9 | 	https://leetcode.com/problems/climbing-stairs/solution/    -->answer is fibonacci sequence <br>
10 | 5. Maximum Sum Subarray <br>
11 | 	https://leetcode.com/submissions/detail/373126210/  <br>
12 | 6. Range Sum Query <br> 
13 | 	https://leetcode.com/problems/range-sum-query-immutable/submissions/ <br>
14 | 7. Houses & Robbers <br> 
15 | 	https://leetcode.com/problems/house-robber/discuss/156523/From-good-to-great.-How-to-approach-most-of-DP-problems. <br>
16 | 8. Best time to buy and sell stocks <br>
17 | 
18 | 9. LCS<br>
19 | 	Methods- Recursive, Memoization, Tabulation, Space Optimized tabulation<br>
20 | 	https://leetcode.com/problems/longest-common-subsequence/submissions/ <br>
21 | 	https://www.youtube.com/watch?v=LAKWWDX3sGw&t=379s <br>
22 | 	https://www.youtube.com/watch?v=DuikFLPt8WQ <br>
23 |  
24 | 10. Number of ways to create a sum from infinite supplies of some coins <br>
25 | 	https://ideone.com/sUupze <br>
26 | 	https://ideone.com/DKsNB7	 <br>
27 | 
28 | 11. Edit Distance <br>
29 | 	https://leetcode.com/problems/edit-distance/submissions/ <br>
30 | 
31 | 12. Longest Increasing Subsequence <br>
32 | 	https://leetcode.com/problems/longest-increasing-subsequence/ <br>
33 | 
34 | 13. Coin change 2 --> Number of ways to give changes with infinite supply of 'x' coins <br>
35 | 	https://leetcode.com/problems/coin-change-2/ <br>
36 | 
37 | 14. Coin Change 1 --> Find the fewest number of coins required from infinite supplies of 'x' coins <br>
38 | 	https://leetcode.com/problems/coin-change/submissions/ <br>
39 | 
40 | 15. Maximum cuts<br>
41 | 
42 | 16. Minimum Jumps <br>
43 | 	https://www.youtube.com/watch?v=IKxezpfH4aw <br>
44 | 
45 | 17. 0-1 Knapsack <br>
46 | 	https://www.interviewbit.com/problems/0-1-knapsack/ <br>
47 | 
48 | 18. Edit Distance <br>
49 | 	https://www.youtube.com/watch?v=AuYujVj646Q <br>
50 | 	https://leetcode.com/problems/edit-distance/submissions/ <br>
51 | 
52 | 19. Maximum Sum Increasing Subsequence <br>
53 | 	https://ideone.com/dIpCi0 <br>
54 | 	https://www.geeksforgeeks.org/maximum-sum-increasing-subsequence-dp-14/ <br>
55 |  
56 | 20. Minimum sum path <br>
57 | 	https://www.geeksforgeeks.org/min-cost-path-dp-6/ <br>
58 | 	https://leetcode.com/problems/minimum-path-sum/discuss/23457/C%2B%2B-DP <br>
59 | 
60 | 


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                                  Apache License
  2 |                            Version 2.0, January 2004
  3 |                         http://www.apache.org/licenses/
  4 | 
  5 |    TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
  6 | 
  7 |    1. Definitions.
  8 | 
  9 |       "License" shall mean the terms and conditions for use, reproduction,
 10 |       and distribution as defined by Sections 1 through 9 of this document.
 11 | 
 12 |       "Licensor" shall mean the copyright owner or entity authorized by
 13 |       the copyright owner that is granting the License.
 14 | 
 15 |       "Legal Entity" shall mean the union of the acting entity and all
 16 |       other entities that control, are controlled by, or are under common
 17 |       control with that entity. For the purposes of this definition,
 18 |       "control" means (i) the power, direct or indirect, to cause the
 19 |       direction or management of such entity, whether by contract or
 20 |       otherwise, or (ii) ownership of fifty percent (50%) or more of the
 21 |       outstanding shares, or (iii) beneficial ownership of such entity.
 22 | 
 23 |       "You" (or "Your") shall mean an individual or Legal Entity
 24 |       exercising permissions granted by this License.
 25 | 
 26 |       "Source" form shall mean the preferred form for making modifications,
 27 |       including but not limited to software source code, documentation
 28 |       source, and configuration files.
 29 | 
 30 |       "Object" form shall mean any form resulting from mechanical
 31 |       transformation or translation of a Source form, including but
 32 |       not limited to compiled object code, generated documentation,
 33 |       and conversions to other media types.
 34 | 
 35 |       "Work" shall mean the work of authorship, whether in Source or
 36 |       Object form, made available under the License, as indicated by a
 37 |       copyright notice that is included in or attached to the work
 38 |       (an example is provided in the Appendix below).
 39 | 
 40 |       "Derivative Works" shall mean any work, whether in Source or Object
 41 |       form, that is based on (or derived from) the Work and for which the
 42 |       editorial revisions, annotations, elaborations, or other modifications
 43 |       represent, as a whole, an original work of authorship. For the purposes
 44 |       of this License, Derivative Works shall not include works that remain
 45 |       separable from, or merely link (or bind by name) to the interfaces of,
 46 |       the Work and Derivative Works thereof.
 47 | 
 48 |       "Contribution" shall mean any work of authorship, including
 49 |       the original version of the Work and any modifications or additions
 50 |       to that Work or Derivative Works thereof, that is intentionally
 51 |       submitted to Licensor for inclusion in the Work by the copyright owner
 52 |       or by an individual or Legal Entity authorized to submit on behalf of
 53 |       the copyright owner. For the purposes of this definition, "submitted"
 54 |       means any form of electronic, verbal, or written communication sent
 55 |       to the Licensor or its representatives, including but not limited to
 56 |       communication on electronic mailing lists, source code control systems,
 57 |       and issue tracking systems that are managed by, or on behalf of, the
 58 |       Licensor for the purpose of discussing and improving the Work, but
 59 |       excluding communication that is conspicuously marked or otherwise
 60 |       designated in writing by the copyright owner as "Not a Contribution."
 61 | 
 62 |       "Contributor" shall mean Licensor and any individual or Legal Entity
 63 |       on behalf of whom a Contribution has been received by Licensor and
 64 |       subsequently incorporated within the Work.
 65 | 
 66 |    2. Grant of Copyright License. Subject to the terms and conditions of
 67 |       this License, each Contributor hereby grants to You a perpetual,
 68 |       worldwide, non-exclusive, no-charge, royalty-free, irrevocable
 69 |       copyright license to reproduce, prepare Derivative Works of,
 70 |       publicly display, publicly perform, sublicense, and distribute the
 71 |       Work and such Derivative Works in Source or Object form.
 72 | 
 73 |    3. Grant of Patent License. Subject to the terms and conditions of
 74 |       this License, each Contributor hereby grants to You a perpetual,
 75 |       worldwide, non-exclusive, no-charge, royalty-free, irrevocable
 76 |       (except as stated in this section) patent license to make, have made,
 77 |       use, offer to sell, sell, import, and otherwise transfer the Work,
 78 |       where such license applies only to those patent claims licensable
 79 |       by such Contributor that are necessarily infringed by their
 80 |       Contribution(s) alone or by combination of their Contribution(s)
 81 |       with the Work to which such Contribution(s) was submitted. If You
 82 |       institute patent litigation against any entity (including a
 83 |       cross-claim or counterclaim in a lawsuit) alleging that the Work
 84 |       or a Contribution incorporated within the Work constitutes direct
 85 |       or contributory patent infringement, then any patent licenses
 86 |       granted to You under this License for that Work shall terminate
 87 |       as of the date such litigation is filed.
 88 | 
 89 |    4. Redistribution. You may reproduce and distribute copies of the
 90 |       Work or Derivative Works thereof in any medium, with or without
 91 |       modifications, and in Source or Object form, provided that You
 92 |       meet the following conditions:
 93 | 
 94 |       (a) You must give any other recipients of the Work or
 95 |           Derivative Works a copy of this License; and
 96 | 
 97 |       (b) You must cause any modified files to carry prominent notices
 98 |           stating that You changed the files; and
 99 | 
100 |       (c) You must retain, in the Source form of any Derivative Works
101 |           that You distribute, all copyright, patent, trademark, and
102 |           attribution notices from the Source form of the Work,
103 |           excluding those notices that do not pertain to any part of
104 |           the Derivative Works; and
105 | 
106 |       (d) If the Work includes a "NOTICE" text file as part of its
107 |           distribution, then any Derivative Works that You distribute must
108 |           include a readable copy of the attribution notices contained
109 |           within such NOTICE file, excluding those notices that do not
110 |           pertain to any part of the Derivative Works, in at least one
111 |           of the following places: within a NOTICE text file distributed
112 |           as part of the Derivative Works; within the Source form or
113 |           documentation, if provided along with the Derivative Works; or,
114 |           within a display generated by the Derivative Works, if and
115 |           wherever such third-party notices normally appear. The contents
116 |           of the NOTICE file are for informational purposes only and
117 |           do not modify the License. You may add Your own attribution
118 |           notices within Derivative Works that You distribute, alongside
119 |           or as an addendum to the NOTICE text from the Work, provided
120 |           that such additional attribution notices cannot be construed
121 |           as modifying the License.
122 | 
123 |       You may add Your own copyright statement to Your modifications and
124 |       may provide additional or different license terms and conditions
125 |       for use, reproduction, or distribution of Your modifications, or
126 |       for any such Derivative Works as a whole, provided Your use,
127 |       reproduction, and distribution of the Work otherwise complies with
128 |       the conditions stated in this License.
129 | 
130 |    5. Submission of Contributions. Unless You explicitly state otherwise,
131 |       any Contribution intentionally submitted for inclusion in the Work
132 |       by You to the Licensor shall be under the terms and conditions of
133 |       this License, without any additional terms or conditions.
134 |       Notwithstanding the above, nothing herein shall supersede or modify
135 |       the terms of any separate license agreement you may have executed
136 |       with Licensor regarding such Contributions.
137 | 
138 |    6. Trademarks. This License does not grant permission to use the trade
139 |       names, trademarks, service marks, or product names of the Licensor,
140 |       except as required for reasonable and customary use in describing the
141 |       origin of the Work and reproducing the content of the NOTICE file.
142 | 
143 |    7. Disclaimer of Warranty. Unless required by applicable law or
144 |       agreed to in writing, Licensor provides the Work (and each
145 |       Contributor provides its Contributions) on an "AS IS" BASIS,
146 |       WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147 |       implied, including, without limitation, any warranties or conditions
148 |       of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149 |       PARTICULAR PURPOSE. You are solely responsible for determining the
150 |       appropriateness of using or redistributing the Work and assume any
151 |       risks associated with Your exercise of permissions under this License.
152 | 
153 |    8. Limitation of Liability. In no event and under no legal theory,
154 |       whether in tort (including negligence), contract, or otherwise,
155 |       unless required by applicable law (such as deliberate and grossly
156 |       negligent acts) or agreed to in writing, shall any Contributor be
157 |       liable to You for damages, including any direct, indirect, special,
158 |       incidental, or consequential damages of any character arising as a
159 |       result of this License or out of the use or inability to use the
160 |       Work (including but not limited to damages for loss of goodwill,
161 |       work stoppage, computer failure or malfunction, or any and all
162 |       other commercial damages or losses), even if such Contributor
163 |       has been advised of the possibility of such damages.
164 | 
165 |    9. Accepting Warranty or Additional Liability. While redistributing
166 |       the Work or Derivative Works thereof, You may choose to offer,
167 |       and charge a fee for, acceptance of support, warranty, indemnity,
168 |       or other liability obligations and/or rights consistent with this
169 |       License. However, in accepting such obligations, You may act only
170 |       on Your own behalf and on Your sole responsibility, not on behalf
171 |       of any other Contributor, and only if You agree to indemnify,
172 |       defend, and hold each Contributor harmless for any liability
173 |       incurred by, or claims asserted against, such Contributor by reason
174 |       of your accepting any such warranty or additional liability.
175 | 
176 |    END OF TERMS AND CONDITIONS
177 | 
178 |    APPENDIX: How to apply the Apache License to your work.
179 | 
180 |       To apply the Apache License to your work, attach the following
181 |       boilerplate notice, with the fields enclosed by brackets "[]"
182 |       replaced with your own identifying information. (Don't include
183 |       the brackets!)  The text should be enclosed in the appropriate
184 |       comment syntax for the file format. We also recommend that a
185 |       file or class name and description of purpose be included on the
186 |       same "printed page" as the copyright notice for easier
187 |       identification within third-party archives.
188 | 
189 |    Copyright [yyyy] [name of copyright owner]
190 | 
191 |    Licensed under the Apache License, Version 2.0 (the "License");
192 |    you may not use this file except in compliance with the License.
193 |    You may obtain a copy of the License at
194 | 
195 |        http://www.apache.org/licenses/LICENSE-2.0
196 | 
197 |    Unless required by applicable law or agreed to in writing, software
198 |    distributed under the License is distributed on an "AS IS" BASIS,
199 |    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200 |    See the License for the specific language governing permissions and
201 |    limitations under the License.
202 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | <pre>This repo contains my personal suggestions on how someone can prepare for placements.
 2 | The <b><a href="https://github.com/Anupriya1729/JobPrep/blob/main/1.%20Placement%20Guide.pdf">Placement Guide</a></b> contains all the important things (according to me) 
 3 | that a student should know about placements.
 4 | <b>To access the links in the pdf</b>
 5 | Open the <b><a href="https://github.com/Anupriya1729/JobPrep/blob/main/1.%20Placement%20Guide.pdf">Placement Guide</a></b> file on laptop -> click on download -> open it on your laptop.
 6 | <b>I'll keep updating the pdf according to the latest information so keep an eye on the 
 7 | update date mentioned on 1st page of the pdf.</b>
 8 | 
 9 | I personally struggled a lot when I started. I faced a lot of problems in figuring out what to do 
10 | and how the placement process looks like.
11 | I have prepared this pdf so that the upcoming batches do not face such problems.
12 | 
13 | Best Youtube Channels:
14 | 1. take U forward
15 |     <a href="https://www.youtube.com/results?search_query=take+u+forward">https://www.youtube.com/results?search_query=take+u+forward</a>
16 | 
17 | 2. TECH DOSE
18 |     <a href="https://www.youtube.com/channel/UCnxhETjJtTPs37hOZ7vQ88g">https://www.youtube.com/channel/UCnxhETjJtTPs37hOZ7vQ88g</a>
19 |     
20 | 3. Code NCode
21 |     <a href="https://www.youtube.com/channel/UC0zvY3yIBQTrSutsV-4yscQ">https://www.youtube.com/channel/UC0zvY3yIBQTrSutsV-4yscQ</a>
22 | 
23 | 4. Rachit Jain
24 |     <a href="https://www.youtube.com/channel/UC9fDC_eBh9e_bogw87DbGKQ">https://www.youtube.com/channel/UC9fDC_eBh9e_bogw87DbGKQ</a>
25 | 
26 | ✅ SDE SHEET (to be solved before interviews): <a href="https://bit.ly/takeUforward_SDE">https://bit.ly/takeUforward_SDE</a>
27 | 
28 | To know about job opportunities:
29 | <a href="https://www.youtube.com/user/ARSHG1998">https://www.youtube.com/user/ARSHG1998</a>
30 | 
31 | Best Blog for DP:
32 | <a href="https://leetcode.com/discuss/general-discussion/458695/dynamic-programming-patterns">https://leetcode.com/discuss/general-discussion/458695/dynamic-programming-patterns </a>
33 | 
34 | Backtracking:
35 | <a href="https://leetcode.com/discuss/interview-question/1098081/Famous-Backtracking-Problems">https://leetcode.com/discuss/interview-question/1098081/Famous-Backtracking-Problems </a>
36 | 
37 | 
38 | <b><h3>You can also book a 1:1 mentorship session with me for more guidance:</h3>
39 | <a href="https://unstop.com/mentor/anupriya">https://unstop.com/mentor/anupriya</a>
40 | </pre>
41 | 


--------------------------------------------------------------------------------
/TUF.pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/Anupriya1729/JobPrep/a915c13f1303eb5daea0d33317d4a1c34e1097b2/TUF.pdf


--------------------------------------------------------------------------------