Skip to content

SAM-uSOFT ( 5.3 YOE, ex-Sam,ex-NXP, ex- marvel) #6

@PranabNandy

Description

@PranabNandy
Owner

https://www.linkedin.com/in/hmntstr/

https://www.linkedin.com/in/robin-badsara/ Microsoft | ex- Samsung (1.7 YOE)

Arindam Nandi
Avijit Malik -Google
Chayan Jain
Anirban Chakraborty - G,A,SAP, Oracle

I am also from NITK

Activity

PranabNandy

PranabNandy commented on Feb 27, 2025

@PranabNandy
OwnerAuthor

Hemant Suthar

zindegi mein kohi cheez agar kohi ek insan already kiya hai toh
Then uss cheez ko tu bhi kar sakta hai

TU na tough cheez se bohot bhag te hai

Amar Kumar
Microsoft | ex-Intel (1 year) | ex- SSIR (3.3 yoe)

Robin Badsara
Microsoft | ex- SSIR (1.7 yoe)

Parameswara Reddy Bodeddula
Microsoft ( 4 yoe) | ex-SSIR ( 3.10 YOE)

Priyanka Paliwal | https://www.linkedin.com/in/priyanka-paliwal-b71107123/
Microsoft | ex-Synopsis ( 1 yoe) | ex-Cadance ( 4 yoe) | ex-Qualcomm( 2.3 yoe)

Rahul Khanna https://www.linkedin.com/in/rahul-khanna-6b3150103/
Microsoft (4.5 YOE) | ex- SSIR (3.4 YOE)

https://www.linkedin.com/in/jayant-shekhar/

Microsoft | ex-SSIR | ex-Qualcomm | ex-STMicro

Sargam Pahuja
Microsoft (1.5 YOE) | SSIR (7.2 YOE)

Sujit Gupta
NITK->Amdocs-> SBI

PranabNandy

PranabNandy commented on Feb 27, 2025

@PranabNandy
OwnerAuthor

https://www.linkedin.com/in/digvijay-singh-chauhan-78bb3447/
From differernt Embedded company to MicroSoft

PranabNandy

PranabNandy commented on Feb 27, 2025

@PranabNandy
OwnerAuthor
PranabNandy

PranabNandy commented on Feb 27, 2025

@PranabNandy
OwnerAuthor

Thumb Rule:

  1. Recursion : n --> 1 💊💊 => Tabulation : 1 --> n

  2. 🛠

  • 3D array --> 2D array
  • 2D array --> 2 x 1D array --> Single 1D array { prev, curr }
  • 1D array --> 2 variable ( one exception case)
  1. 💻 Infinite supply / multiple uses ---> stay in the same index

  2. 🔑 if base condition is

 if(j<0) return i ;
// Then make it to
if(j==0) return i+1;
  1. 💡 During shifting from prev, curr ----> curr
    take care of this condition like
for(int i=0;i<=n;i++) prev[i]=i+1;
// From that to this
curr[0]= i+1;

Image

distinct-subsequences

From 2 1D array to 1 1D array** ----> j=m;j>=1; j-- ---> It is reverse in this case
https://leetcode.com/problems/distinct-subsequences/submissions/1557202118/

  1. gcd(a,b):
 gcd(a,b)
{     
    if(a>b)  a=a%b;  gcd(b,a%b);
}
  1. Don't use sqrt() functions
for(int i=1;i<sqrt(n);i++)   ===> Use this one ==>  for (int i=1; i*i <n ;i++) 
  1. Prime Factor : O(sqrt(n))
for(i:2 -> sqrt(n))
{ 
    if(n%i==0){
           list.add (i)
           if(n%i==0)  n=n/i;
}
if(n!=1) list.add(n);
  1. pow() function in O(logn) time
int power(int x, int y) {
int ans=1;
while(y>0){
       if(y%2){
           ans=ans*x;    // y==1
           y=y-1;
      }
      else{
        x=x*x;
        y=y/2;
      }
}
return ans;
  1. Print all prime number from 2 to N

Image

PranabNandy

PranabNandy commented on Feb 27, 2025

@PranabNandy
OwnerAuthor

Image

PranabNandy

PranabNandy commented on Feb 28, 2025

@PranabNandy
OwnerAuthor

Google:
Elimination Round:
1,3,2, 15,8
1,2, 7, 8
---> preserve the order i.e
1,3,2 7,15,8 --> is valid sequence

1,3,2, 15,8
1,2, 7, 8,15
--> there is no valid sequence as cyclic dependency is there

Round 1:
One Source to destination in Graph with a given Certains terms and condition
The Broadcase message and shutdown

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

      Development

      No branches or pull requests

        Participants

        @PranabNandy

        Issue actions

          SAM-uSOFT ( 5.3 YOE, ex-Sam,ex-NXP, ex- marvel) · Issue #6 · PranabNandy/Leetcode-Patterns