Astitva Arya

@takeUforward_ @striver_79 @jolly1094 @OrionAnkit Learnings from Day 6 #SDESheetChallenge • Majority Element-II using frequency counting. • Grid Unique Paths using DP and combinatorics. • Reverse Pairs using Merge Sort for O(N log N) pair counting. #DSA #LeetCode #CPP

Day 6 of #SDESheetChallenge Solved: ✔️Majority Element-II ✔️Grid unique paths ✔️Reverse Pairs @takeUforward_ @striver_79 #DSA #LeetCode #StriversSDE

@abhishekjha58 @takeUforward_ @striver_79 @OrionAnkit @jolly1094 Yep bro, I went with the HashMap approach first. Moore's Voting Algorithm is definitely the better optimized solution with O(1) space. Thanks for pointing it out! 🙌

@astitva_arya @takeUforward_ @striver_79 @OrionAnkit @jolly1094 Bro you can use Moore's voting algorithm in Majority Element question to solve it in constant space.

Day 5 of #SDESheetChallenge Solved: ✔️Search in a 2D matrix ✔️Pow(x, n) ✔️Majority Element-I @takeUforward_ @striver_79 #DSA #LeetCode #StriversSDE

@takeUforward_ @striver_79 @OrionAnkit @jolly1094 Learnings from Day 5 of #SDESheetChallenge • Applied Binary Search on a 2D Matrix by treating it as a sorted 1D array. • Learned Binary Exponentiation to compute Pow(x, n) in O(log n). • Used HashMap/Frequency Counting to efficiently find the Majority Element. #DSA #LeetCode

@takeUforward_ @striver_79 @jolly1094 Learnings from Day 4 #SDESheetChallenge #TakeUForward • Used Hashing to find the duplicate number efficiently. • Applied Frequency Array (Hashing) to identify the repeating and missing numbers. • Learned how Merge Sort helps count inversions in O(N log N). #DSA #LeetCode #CPP

Day 4 of #SDESheetChallenge Solved: ✔️Find the Duplicate Number ✔️Find the repeating and missing number ✔️Inversion of Array (Pre-req: Merge Sort) @takeUforward_ @striver_79 #DSA #LeetCode #StriversSDE

@KunikaKishore Interested

#internship opportunity offering ₹50,000 stipend per month for a duration of 3-6 months at #Bangalore !!

@isha_n28 @takeUforward_ @striver_79 Sure 🙌🏻

@astitva_arya @takeUforward_ @striver_79 Keep it up, let's connect.

Day 3 of #SDESheetChallenge Solved: ✔️Rotate matrix by 90 degrees ✔️Merge Overlapping Subintervals ✔️Merge two sorted arrays without extra space @takeUforward_ @striver_79 #DSA #LeetCode #StriversSDE

@jolly1094 @takeUforward_ @striver_79 My bad, I will take care of it from tomorrow. Thanks for telling me.

@astitva_arya @takeUforward_ @striver_79 :/

@jolly1094 @takeUforward_ @striver_79 Konsa data 🤔🤔

@astitva_arya @takeUforward_ @striver_79 esa kya sensitive data hai😷😷

@takeUforward_ @striver_79 Learnings from Day 3 • Rotate Matrix – Transpose + reverse each row → O(1) space ✅ • Merge Overlapping Intervals – Sort by start, greedily merge if overlap ✅ • Merge Two Sorted Arrays – Gap method (Shell sort trick), no extra space ✅ #SDESheetChallenge #DSA

@KunikaKishore Interested

📌 IBM is hiring #freshers for Associate Engineer role, offering a salary ₹8-11 LPA and the location is #Hyderabad !! Education:- BE / BTech Computer Science (all CS batches like CSE, AIML , DS) , or Information Technology with 6 CGPA/60%

@insanekrishnaa Interested

Hiring | Full Stack Engineer Remote | React, Next.js, Node.js, Python & GCP Pay: Competitive salary based on experience Flexiple is hiring engineers who can build and ship production-grade full stack systems in a fast-moving startup environment. What makes this role stand out: • Work on cloud-native systems built on GCP • Build scalable products using React, Next.js, Node.js & Python • Collaborate with globally distributed engineering teams • Strong ownership, fast execution & real product impact • Open-source contributions, GitHub projects & personal builds are valued What you'll do: • Own full-stack features end-to-end in a cloud-native GCP environment • Build scalable applications using React, Next.js, Node.js & Python • Contribute to platform architecture, scalability & engineering best practices • Ship production-quality code with speed and reliability • Work with modern tools including Kubernetes/GKE, Airflow, Neo4j, Apache Trino, Cube.js & more Perfect for developers who: • Have strong hands-on experience with React, Next.js, Node.js & Python • Understand cloud-native development and GCP • Have active GitHub projects, open-source contributions or personal builds • Thrive in startup environments with high ownership • Enjoy building products and solving real-world problems Why join? • Fully remote • High ownership and autonomy • Fast-growing startup environment • Work with modern cloud-native technologies • Direct impact on product and engineering decisions Shortlisting has already started and early applicants will be prioritized. Repost so someone in your network doesn't miss this opportunity Interested candidates can reply to this post and the application link will be shared directly in DM 👇🏻

@takeUforward_ @striver_79 Learnings from Day 2 • Kadane's Algorithm – Maximum subarray sum in O(n) ✅ • Sort 0's, 1's & 2's – Dutch National Flag Algorithm ✅ • Stock Buy & Sell – Track minimum price for maximum profit ✅ #SDESheetChallenge #DSA

Day 2 of #SDESheetChallenge Solved: ✔️Kadane's Algorithm ✔️Sort an array of 0's 1's and 2's ✔️Stock Buy and Sell @takeUforward_ @striver_79 #DSA #LeetCode #StriversSDE