I created a video on the famous Leetcode problem "Perform minimum swaps between 2 arrays to make both of them sorted". It explores a non-traditional approach that does not use DP.
Find how many string pairs are there in array such that at least one permutation of their concatentation is a palindrome.
I created a video discussing the technique to solve this.
26 Followers 322 FollowingSWE | Ex-SDE at an early stage startup | Ex-SWE intern @Microsoft |
Trying to be the jack of all skills rather than master of one.
2K Followers 1K FollowingFounding Eng @sharedotxyz Ex @Slicebank, Early @0xPPL_ ( By @Rippling co founder ) ICPC Asia Regionalist 2x National Art Olympiad winner / Army Institute of T
269 Followers 4K FollowingClaude Computer || Should've been a statistic, learning to be an outlier now || Building things one commit at a time. Sharing Memes, one tweet at a time. 🙌
6K Followers 735 FollowingPrincipal Eng @prophecy_io | Building @JOSH_COMMUNITY |
Open-source excalidraw, mermaid-to-excalidraw, react-tags and more
❤️ front-end | JavaScript and React