
Aryan
174 posts




🗓️ Day 17– #SDESheetChallenge✅
1. Combination Sum
2. Combination Sum II
3. Palindrome Partitioning
@takeUforward_



English

🗓️ Day 16 – #SDESheetChallenge✅
1. Minimum coins
2. Assign Cookies
3. Subset Sums
4. Subsets II
@takeUforward_




English

🗓️ Day 15 – #SDESheetChallenge✅
1. N meetings in one room
2. Minimum number of platforms required for a railway
3. Fractional Knapsack
@takeUforward_ @striver_79



English

🗓️ Day 13 – #SDESheetChallenge✅
1. Rotate List in LL
2. Copy List with Random Pointer
3. 3 Sum
@takeUforward_ @striver_79



English

🗓️ Day 14 – #SDESheetChallenge✅
1. Trapping Rain Water
2. Remove Duplicates from Sorted Array
3. Max Consecutive Ones
@takeUforward_ @striver_79



English

@aryan072004 At the end Specialization(Aiml) got you an internship 😭
English

🗓️ Day 12– #SDESheetChallenge✅
1. Check if LL is palindrome or not
2. Find the starting point in LL
3. Flattening of LL
@takeUforward_ @striver_79



English

🗓️ Day 11 – #SDESheetChallenge✅
1. Intersection of Two Linked Lists
2. Linked List Cycle
3. Reverse Nodes in k-Group
@takeUforward_ @striver_79



English

🗓️ Day 10 – #SDESheetChallenge✅
1. Remove Nth Node from End of List
2. Add two numbers as LinkedList
3. Delete Node in a Linked List



English

🗓️ Day 8 – #SDESheetChallenge✅
1. Reverse Linked List
2. Middle of the Linked List
3. Merge Two Sorted Lists
@takeUforward_ @striver_79



English

🗓️ Day 8 – #SDESheetChallenge✅
1. Largest Subarray with K sum
2. Count subarrays with given XOR K
3. Longest Substring Without Repeating Characters



English

🗓️ Day 7 – #SDESheetChallenge✅
1. Two Sum
2. 4 Sum
3. Longest Consecutive Sequence in an Array
Some important problems were solved today🌚
@takeUforward_ @striver_79



English


@Sagar_Spea0ks @striver_79 @takeUforward_ Haan bit manipulation + binary exponentiation dono use karna pdega
Indonesia

🗓️ Day 5 – #SDESheetChallenge ✅
1. Search a 2D Matrix
2. Pow(x, n)
3. Majority Element - 1
Revised Moore's Voting Algorithm today!!
@striver_79 @takeUforward_



English







