Select Cover Image

To crop
Crop Set as Cover Image

Rikam Palkar background image
Author
Rikam Palkar
Solution Architect, .NET Full Stack, DSA, C#, React, Blazor, WPF, JavaScript
Mumbai (India)
27
4.9m
42.2k
Platinum
50
Recognitions & awards
    • Jun 2020
    • Jun 2021
    • Jun 2022
    • Jun 2023
    • Jun 2024
    • Jun 2025
Badges
Expand
Awards & Certifications
  • AWS Solutions Architect
    AWS
  • MCA
    VJTI
About

"Microsoft MVP", "AWS Solutions Architect" Five-time "C# Corner MVP", "Verified author" on Medium "Top voice" on LinkedIn, Author behind 'WPF Simplified' and 'Blazor Simplified'.I'm passionate about making the world a better place by writing scalable, efficient code, I'm skilled at Blazor, WPF, C#, and Data Structures & Algorithms.

Activity
What is JSX in React?

What is JSX in React?

23h 270 0 Article
What is Virtual DOM in React?

What is Virtual DOM in React?

1d 325 0 Article

Binary Search!

LeetCode Daily, Oct 8, 2025!
Medium

2300. Successful Pairs of Spells and Potions
Image previewImage preview
Post 1w

Finally a Use Case for Red-Black Tree!
1488. Avoid Flood in The City

#LeetCode

Image previewImage preview
Post 1w

LeetCode Daily · Oct 6 · Swim in Rising Water (Hard)

Problem: Find the minimum time to reach bottom-right when water rises with elevation.

Approach: Use Dijkstra-style BFS, explore grid with a min-heap, always picking the lowest elevation reachable.

Complexity:

Time: O(n² log n)
Space: O(n²)

Image previewImage preview
Post 1w
Transformers in AI

Transformers in AI

2w 635 0 Article
The Fascinating History of AI: From Turing to Today

The Fascinating History of AI: From Turing to Today

3w 854 0 Article
Foundation Models: Everything, Everywhere, All at Once!

Foundation Models: Everything, Everywhere, All at Once!

3w 1.1k 0 Article
The ABCs of Deep Learning

The ABCs of Deep Learning

3w 1.5k 0 Article
The ABCs of Machine Learning

The ABCs of Machine Learning

3w 1.6k 0 Article
Layers of Artificial Intelligence

Layers of Artificial Intelligence

3w 2.3k 0 Article
Why Learning AWS Changed How I See Modern Tech - AWS Solutions Architect A...

Why Learning AWS Changed How I See Modern Tech - AWS Solutions Architect A...

Aug 20 418 0 Article
Easy way to Handle cancellation of API Requests in React with AbortSignal ...

Easy way to Handle cancellation of API Requests in React with AbortSignal ...

Aug 20 640 0 Article
Re: Angular vs React with .NET in 2025 – Which Should I Learn?

Re: Angular vs React with .NET in 2025 – Which Should I Learn?

Jun 16 Forum
You’re Using useState for That? Cute

You’re Using useState for That? Cute

Jun 15 625 0 Article

Bob here changed one digit & suddenly became richer than Elon.

#Algorithm
To get the max number: First digit has to be 9, loop till you find digit is < 9 then replace all occurrences of that first digit with 9.
To get the min number: Same as first step, here first digit has to be 1
Return: max - min.

#GitHub: https://github.com/RikamPalkar/DSA-Simplified/blob/main/LeetCode/2566. Maximum Difference by Remapping a Digit.cs

#Algorihm #Coding #Programming

Image previewImage preview
Post Jun 14

Tried Greedy with 2 sorts, didn’t Cut It hence Binary Search!

#Algorithm
- Sort the Array
-- So we can try to pair close numbers and minimize the differences.

- Binary Search
- The smallest possible max difference is 0, the largest is max(nums) - min(nums).
- Guess a Difference (mid) and Try It
- Check if We Can Form p Pairs where mid <= p
-- If yes, try a smaller mid. If no, try a bigger one.

- When l == r, you've found the smallest max difference that allows p pairs.
Image previewImage preview
Post Jun 13

Its easy problem today guys

Image previewImage preview
Post Jun 12
Wrapper Component to Consumer Component: That’s a Wrap!

Wrapper Component to Consumer Component: That’s a Wrap!

Jun 09 814 1 Article

DFS and Maths should never be combined!

#Algorithm
- DFS numbers 1 to 9
- Base condition: If the current number exceeds n, stop recursion.
- Else add the current number to the result list.
Multiply the number by 10 to get to the next level (1 - 10, 10 - 19, 100 - 109).
- For the deeper level:
-- If the next level starting number exceeds n, return.
-- Else, recurse for each number in the range [curr number, curr number, + 9].
Image previewImage preview
Post Jun 08
Expertise
Trending
View all
Message