amansharma264's profile picture. Full-Stack developer |C++| @takeUforward_ | @LeetCode | @GeeksforGeeks | SME at Physics Wallah| SME at Chegg India

Aman sharma

@amansharma264

Full-Stack developer |C++| @takeUforward_ | @LeetCode | @GeeksforGeeks | SME at Physics Wallah| SME at Chegg India

Pinned

Thank you @ChaiCodeHQ (@Hiteshdotcom sir 🙏🙏) for featuring my thoughts! 🙌 Just sharing what I genuinely experienced in my first year — real growth starts outside the comfort zone.

I asked Aman, What are the 5 most important things you've learned after a year of college? Here is the answer 👇



🎯 Solved POTD – Count Elements Less Than or Equal to K in a Sorted Rotated Array 🔍 Problem: Given a sorted rotated array and an integer K, count how many elements are less than or equal to K. 🧠 Approach: • Find the pivot index (smallest element) using binary search. • This…

amansharma264's tweet image. 🎯 Solved POTD – Count Elements Less Than or Equal to K in a Sorted Rotated Array

🔍 Problem:
Given a sorted rotated array and an integer K, count how many elements are less than or equal to K.

🧠 Approach:
• Find the pivot index (smallest element) using binary search.
• This…

🖥️ Codeforces Round 1071 (Div. 3) Today I participated in Codeforces Round 1071 (Div. 3) 🖥️ After a one-month gap, it felt great to return to a live contest. The problems offered a nice mix of basic logic and implementation skills. I solved 2 problems. Though there's much to…

amansharma264's tweet image. 🖥️ Codeforces Round 1071 (Div. 3)

Today I participated in Codeforces Round 1071 (Div. 3) 🖥️

After a one-month gap, it felt great to return to a live contest. The problems offered a nice mix of basic logic and implementation skills.

I solved 2 problems. Though there's much to…

Back to DSA - Stronger & More Focused 🚀 After a long break, I’m excited to resume my Data Structures & Algorithms journey. I’ve already completed around half of DSA, practiced many problems, and even participated in contests on LeetCode, CodeChef, and Codeforces. But somewhere…

amansharma264's tweet image. Back to DSA - Stronger & More Focused 🚀

After a long break, I’m excited to resume my Data Structures & Algorithms journey.

I’ve already completed around half of DSA, practiced many problems, and even participated in contests on LeetCode, CodeChef, and Codeforces. But somewhere…

🎯 Solved GFG POTD – Elements in Range [a, b] 🔍 Problem: Given an array of integers and multiple queries, each with integers a and b, count how many array elements lie in [a, b] (inclusive) for each query. 🧠 Approach: • Sort the array for efficient searching. • For each…

amansharma264's tweet image. 🎯 Solved GFG POTD – Elements in Range [a, b]

🔍 Problem:
Given an array of integers and multiple queries, each with integers a and b, count how many array elements lie in [a, b] (inclusive) for each query.

🧠 Approach:
• Sort the array for efficient searching.
• For each…

Aman sharma reposted

Luck is a factor quite often heavily overlooked. Even in cases of extreme effort, many times, luck plays such a large role. The longer you are involved, the more you prepare, while leaning into keeping a curious open mind could greatly increase the math that luck might show up.


✅ Completed Sliding Window & Two Pointers (Combined) problems of #TUFWinterArc with @takeUforward_ (Striver Sir) 🚀 📘 Problems Covered: Binary Subarrays With Sum - Hard Count Number of Nice Subarrays - Hard Number of Substrings Containing All Three Characters - Hard 🔥…

amansharma264's tweet image. ✅ Completed Sliding Window & Two Pointers (Combined) problems of #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:

Binary Subarrays With Sum - Hard

Count Number of Nice Subarrays - Hard

Number of Substrings Containing All Three Characters - Hard

🔥…
amansharma264's tweet image. ✅ Completed Sliding Window & Two Pointers (Combined) problems of #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:

Binary Subarrays With Sum - Hard

Count Number of Nice Subarrays - Hard

Number of Substrings Containing All Three Characters - Hard

🔥…

🎯 Solved POTD on Masterji App – Cumulative Sum of an Array 🔍 Problem: Given an array of integers, return a new array where each element at index i is the cumulative sum of elements from index 0 to i. 🧠 Approach: • Create a new array ans of the same size as the input array.…

amansharma264's tweet image. 🎯 Solved POTD on Masterji App – Cumulative Sum of an Array

🔍 Problem:
Given an array of integers, return a new array where each element at index i is the cumulative sum of elements from index 0 to i.

🧠 Approach:
• Create a new array ans of the same size as the input array.…

🎯 Solved GFG POTD – Row with Maximum 1s 🔍 Problem: Given a binary matrix, find the index of the row with the maximum number of 1s. If multiple rows have the same maximum, return the smallest index. 🧠 Approach: - Let n be the number of rows and m the number of columns. -…

amansharma264's tweet image. 🎯 Solved GFG POTD – Row with Maximum 1s

🔍 Problem:
Given a binary matrix, find the index of the row with the maximum number of 1s. If multiple rows have the same maximum, return the smallest index.

🧠 Approach:
- Let n be the number of rows and m the number of columns.
-…

🎯 Solved LeetCode POTD – 955. Delete Columns to Make Sorted II 🔍 Problem: Given an array of strings of equal length, delete the minimum number of columns so the remaining strings are in lexicographical order. 🧠 Approach: • Let n be the number of strings and m be the length…

amansharma264's tweet image. 🎯 Solved LeetCode POTD – 955. Delete Columns to Make Sorted II

🔍 Problem:
Given an array of strings of equal length, delete the minimum number of columns so the remaining strings are in lexicographical order.

🧠 Approach:
• Let n be the number of strings and m be the length…

🎯 Solved GFG POTD – Count X in Range of a Sorted Array 🔍 Problem: Given a sorted array and multiple queries, each with (L, R, X), count how many times X appears in the subarray from index L to R (inclusive). 🧠 Approach: - For each query, perform binary search on [L, R]. -…

amansharma264's tweet image. 🎯 Solved GFG POTD – Count X in Range of a Sorted Array

🔍 Problem:
Given a sorted array and multiple queries, each with (L, R, X), count how many times X appears in the subarray from index L to R (inclusive).

🧠 Approach:
- For each query, perform binary search on [L, R].
-…

🎯 Solved LeetCode POTD – 944. Delete Columns to Make Sorted 🔍 Problem: Given an array of strings of equal length, count the minimum number of columns to delete so that each remaining column is sorted lexicographically from top to bottom. 🧠 Approach: • Let n be the…

amansharma264's tweet image. 🎯 Solved LeetCode POTD – 944. Delete Columns to Make Sorted

🔍 Problem:  
Given an array of strings of equal length, count the minimum number of columns to delete so that each remaining column is sorted lexicographically from top to bottom.

🧠 Approach:  
• Let n be the…

🎯 Solved GFG POTD – Search Insert Position of K in a Sorted Array 🔍 Problem: Given a sorted array and an integer K, find the index where K is present. If K is not present, return the index where it should be inserted to maintain sorted order. 🧠 Approach: • Use binary search…

amansharma264's tweet image. 🎯 Solved GFG POTD – Search Insert Position of K in a Sorted Array

🔍 Problem:
Given a sorted array and an integer K, find the index where K is present. If K is not present, return the index where it should be inserted to maintain sorted order.

🧠 Approach:
• Use binary search…

🎯 Solved GFG POTD – Bus Conductor 🔍 Problem: Given two arrays representing chair and passenger positions, find the minimum moves to seat each passenger on a chair. Each move is the absolute distance between a passenger and a chair. 🧠 Approach: • Sort both arrays. • Pair…

amansharma264's tweet image. 🎯 Solved GFG POTD – Bus Conductor

🔍 Problem:
Given two arrays representing chair and passenger positions, find the minimum moves to seat each passenger on a chair. Each move is the absolute distance between a passenger and a chair.

🧠 Approach:
• Sort both arrays.
• Pair…

✅ Completed Stacks and Queues topics of #TUFWinterArc with @takeUforward_ (Striver Sir) 🚀 📘 Problems Covered: Asteroid Collision — Medium Sum of Subarray Ranges — Medium Remove K Digits — Medium #StriverA2Z #DSARoadmap #Stacks #Queues #CodingJourney #DSAProgress

amansharma264's tweet image. ✅ Completed Stacks and Queues topics of #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:
Asteroid Collision — Medium
Sum of Subarray Ranges — Medium
Remove K Digits — Medium

#StriverA2Z #DSARoadmap #Stacks #Queues #CodingJourney #DSAProgress…
amansharma264's tweet image. ✅ Completed Stacks and Queues topics of #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:
Asteroid Collision — Medium
Sum of Subarray Ranges — Medium
Remove K Digits — Medium

#StriverA2Z #DSARoadmap #Stacks #Queues #CodingJourney #DSAProgress…

✅ Completed Stacks and Queues topics in #TUFWinterArc with @takeUforward_ (Striver Sir) 🚀 📘 Problems Covered: Postfix to Prefix Conversion — Medium Postfix to Infix Conversion — Medium Convert Infix to Prefix Notation — Medium #StriverA2Z #DSARoadmap #Stacks #Queues

amansharma264's tweet image. ✅ Completed Stacks and Queues topics in #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:
Postfix to Prefix Conversion — Medium
Postfix to Infix Conversion — Medium
Convert Infix to Prefix Notation — Medium

#StriverA2Z #DSARoadmap #Stacks #Queues…
amansharma264's tweet image. ✅ Completed Stacks and Queues topics in #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:
Postfix to Prefix Conversion — Medium
Postfix to Infix Conversion — Medium
Convert Infix to Prefix Notation — Medium

#StriverA2Z #DSARoadmap #Stacks #Queues…

🎯 Solved GFG POTD – Count Indices to Balance Even and Odd Sums 🔍 Problem: Given an array, count the number of indices such that removing the element at that index makes the sum of elements at even positions equal to the sum of elements at odd positions. 🧠 Approach: •…

amansharma264's tweet image. 🎯 Solved GFG POTD – Count Indices to Balance Even and Odd Sums

🔍 Problem:  
Given an array, count the number of indices such that removing the element at that index makes the sum of elements at even positions equal to the sum of elements at odd positions.

🧠 Approach:  
•…

✅ Completed Step 9 – Lecture 1 of #TUFWinterArc with @takeUforward_ (Striver Sir) 🚀 📘 Problems Covered: Check for Balanced Parentheses — Easy Implement Min Stack — Hard 🔥 Focused on stack-based logic today—understanding bracket balancing and mastering the Min Stack…

amansharma264's tweet image. ✅ Completed Step 9 – Lecture 1 of #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:

Check for Balanced Parentheses — Easy
Implement Min Stack — Hard

🔥 Focused on stack-based logic today—understanding bracket balancing and mastering the Min Stack…
amansharma264's tweet image. ✅ Completed Step 9 – Lecture 1 of #TUFWinterArc with @takeUforward_  (Striver Sir) 🚀

📘 Problems Covered:

Check for Balanced Parentheses — Easy
Implement Min Stack — Hard

🔥 Focused on stack-based logic today—understanding bracket balancing and mastering the Min Stack…

🎯 Solved GFG POTD – Swap Diagonals 🔍 Problem: Given a square matrix, swap the elements of its primary diagonal with the secondary diagonal. 🧠 Approach: • Let n be the size of the matrix. • Traverse from 0 to n-1 using a single loop. • For each i: - Primary diagonal:…

amansharma264's tweet image. 🎯 Solved GFG POTD – Swap Diagonals

🔍 Problem:
Given a square matrix, swap the elements of its primary diagonal with the secondary diagonal.

🧠 Approach:
• Let n be the size of the matrix.
• Traverse from 0 to n-1 using a single loop.
• For each i:
  - Primary diagonal:…

🎯 Solved GFG POTD – Transpose of Matrix 🔍 Problem: Given a matrix of size m × n, return its transpose (rows become columns, columns become rows). 🧠 Approach: - Get dimensions: m = rows, n = columns - Create a new matrix t of size n × m - For each element: t[i][j] =…

amansharma264's tweet image. 🎯 Solved GFG POTD – Transpose of Matrix

🔍 Problem:  
Given a matrix of size m × n, return its transpose (rows become columns, columns become rows).

🧠 Approach:  
- Get dimensions: m = rows, n = columns  
- Create a new matrix t of size n × m  
- For each element: t[i][j] =…

🎯 Solved GFG POTD – Construct Array from Its Pair-Sum Array 🔍 Problem: Given an array where each element is the sum of a unique pair from an unknown original array, reconstruct the original array. 🧠 Approach: • If the pair-sum array has size 1, return the two possible…

amansharma264's tweet image. 🎯 Solved GFG POTD – Construct Array from Its Pair-Sum Array

🔍 Problem:  
Given an array where each element is the sum of a unique pair from an unknown original array, reconstruct the original array.

🧠 Approach:  
• If the pair-sum array has size 1, return the two possible…

Loading...

Something went wrong.


Something went wrong.