Shubham Kumar @mr_optimizer

Career Update: I’ve joined Cisco as a Software Engineer. Looking forward to the new challenges and opportunities ahead! #cisco #SoftwareEngineer

Hey, #connections , Today I was working on a web #project and was so tired to give this #contest, but my subconscious thought (contest to dena hi hai 👨‍💻 ) that is why I created a new #leetcode account to give today's #Biweekly and eventually, I secure…lnkd.in/deqBngMN

Hey #connections, Exciting news! I just received my LeetCode t-shirt today. I've been using LeetCode for a while now to improve my coding skills, and it feels great to finally have something tangible to show for my efforts. Plus, the t-shirt is actually…lnkd.in/deFYH-tf

I got a new year reward from Leetcode 😍 After waiting a long, I finally managed to get an annual badge 2022 from #leetcode I can't express my fillings #leetcode #dsa #programming #interviewpreparation #codingpractices #codingchallenge #consistencym…lnkd.in/dP4YS5vk

It's a Black day for me. Yesterday, I lost my streak of more than 500 days on Leetcode. I was solving questions on Leetcode since the 16th of May 2021 and hadn't missed a single day till yesterday, but yesterday when I was solving a question I simply run…lnkd.in/dk7wbHhS

hey everyone this question will teach you (a%x + b%x)%x is equal to 0. Try to solve it in O(n) time & space Problem Link:- lnkd.in/dvfycfyM MY SOl:-   bool canPair(vector<int> nums, int k) {     unordered_map<int,int>um;     for(int i = 0; i <…lnkd.in/d-MVRAK8

hey #connections I am sharing very important #interviewquestions on an array that contains an exciting concept, try to solve it in O(n) time and O(1) Space. My Solution int firstMissingPositive(int A[], int n) { for(int i = 0; i < n; ++…lnkd.in/dzzQzSgW

hey #dsaLover Here is a popular #interviewquestions asked in #microsoft #amazon #visa #adobe #samsung try to solve it in Time: O(n) Space: O(1) My #solution   int isPal(string &s, int l, int r){     int ans = 0;      while(l>=0 and r<s.size() and s[…lnkd.in/dkNuRUTw

hey #connections I am sharing an #interviewquestions asked in #adobe #microsoft #amazon #flipkart #yahoo Try to #solve this #interview question in Time: O(n) Space: O(26) #problem Link lnkd.in/deTyuzBA My #solution public: string FirstNonR…lnkd.in/dc-JabKy

hey #connections From #today to next Thursday we will see some #interviewquestions on #linkedlist Try to solve the following #interview question asked in #microsoft #flipkart #adobe in Time: O(n) Space: O(n) Problem Link: lnkd.in/d_jqNsDG My S…lnkd.in/dh2SjtAG

HEY #connections I am sharing an interview question asked in #microsoft #flipkart #amazon #makemytrip Try to solve it in Time:- O(n) Space:- O(n) Problem Link lnkd.in/d8JDDqHz My solution:- class Solution{   public:   int maxLen(vector<int>&…lnkd.in/djm8NyZU

hey #connections I am sharing an interview question asked in #amazon #samsung #snapdeal Try to solve this question in Time :- O(n) Space:- O(1) // #important Problem Link lnkd.in/gJ5HKQUu #comment your solution #happycoding My Solution…lnkd.in/g7-HgmJG

Hey #connections Try to solve the given question in Time - O(n) Space - O(n) which is asked in #amazon #oyo #zoho Problem Link: - lnkd.in/dCid8jS8 My Solution:- int findElement(int a[], int n)   {   int l[n];   int r[n];   int maxi = a[0];  …lnkd.in/dwF3dvMS

Hey #connections, let us learn together. I will daily share a famous #interviewquestions. if(yourBestAnswer() == myBestAnswer()){ comment("matched"); }else{ comment(yourBestAnswer()); } Problem Link lnkd.in/dB5R5RCN My solution:- int strStr(strin…lnkd.in/daKTYw6B

Hey #connections, let us learn together. I will daily share a famous #interviewquestions. if(yourBestAnswer() == myBestAnswer()){ comment("matched"); }else{ comment(yourBestAnswer()); } Problem Link lnkd.in/dkNtViU8 My solution:-   ve…lnkd.in/dE5W2M_v

0x3d91c9E660D37C6459ba01c15e628603b527694E

Hey Everyone, I am glad to share that I achieved the 2574th rank (Round 2) in Meta Hackercup 2022. I get to know about this contest just 30min before the end of the qualification round, and I can't express the feeling of that rush. I am not good at Compet…lnkd.in/dxtBDgBY

Hey Connections, I completed my one-year streak on #leetcode with 800+ problems. I really want to give a special thanks to @geeksforgeeks Sir to taught me #dsa in such a nice way. He is really an awesome teacher. Still, lots to learn from you,…lnkd.in/dGSa2GtQ

0x3d91c9E660D37C6459ba01c15e628603b527694E

0x3d91c9E660D37C6459ba01c15e628603b527694E