PayPal Technical Interview Questions

August 18, 2023

PayPal Technical Interview Questions and Answers 2023

Find the latest Paypal Technical Interview Questions and answers on this page.

Page Highlights:

About PayPal
PayPal Technical Interview Questions

About PayPal

PayPal Holdings, Inc. is an American international financial technology company that operates an online payments system in the majority of countries that enable online money transfers, serving as an electronic alternative to traditional paper methods like cheques and money orders.

Top 100 Codes

Top 100 Puzzles

Interview Prep.

#include <stdio.h>

int duplicates(int arr[], int n)
{
   if (n==0 || n==1)
     return n;

   int temp[n];

   int j = 0;
   for (int i=0; i<n-1; i++)
      if (arr[i] != arr[i+1])
         temp[j++] = arr[i];

   temp[j++] = arr[n-1];

   for (int i=0; i<j; i++)
     arr[i] = temp[i];

   return j;
}

// Driver code
int main()
{
   int arr[] = {10, 20, 20, 30, 40, 40, 40, 50, 50};
   int n = sizeof(arr) / sizeof(arr[0]);

   n = duplicates(arr, n);

   for (int i=0; i<n; i++)
      printf("%d ", arr[i]);

   return 0;
}

Question 11: Write a program to reverse elements of an array.

#include <stdio.h>

void printReverse(int arr[], int len){
    
    for(int i = len - 1; i >= 0; i--)
        printf("%d ", arr[i]);
}

int main()
{
    int arr[] = {10, 20, 30, 40, 50, 60};
    
    int len = sizeof(arr)/sizeof(arr[0]);
    
    printf("Array in Reverse:\n");
    printReverse(arr, len);

    return 0;
}

Question 12: What is GWT?

Answer:

Google Web Toolkit includes a Java-to-JavaScript compiler as well as a debugging web browser.

Question 13: Is exit a keyword in Java?

Answer:

No. You may utilise the exit method in the System object to forcefully end an application.

Question 14: How can type-insensitive macros be created?

Answer:

A type-insensitive macro is one that executes the same fundamental operation to many data types. The concatenation operator can be used to make a call to a type-sensitive function based on the parameter given to the macro in order to complete this task.

Question 15: What are threads?

Answer:

A thread is the smallest unit of computation that may be performed in an operating system. A thread can exist within a process in the majority of contemporary operating systems, meaning that a single process can hold multiple threads.

Question 16: Write a program to find the last non-zero digit in factorial.

Answer:

Question 17: How is HashMap implemented in Java?

Answer:

Hashmap includes an array of nodes (also known as a table), each of which contains a key and a value. The class HashMapEntry here serves as a representation of the Node. HashMap essentially stores the key-value information in an array. It determines the index in the array at which the Node may be inserted, and then it does it.

Question 18: What effective data structure is employed in the internal storage representation of RDBMS?

Answer:

B+ tree. The B+ tree makes searching easier because all the data is simply kept in the leaf nodes. The records that must be stored in leaf nodes correspond to this.

Question 19: Define callback function.

Answer:

A callback function is a function that is supplied as an input to another function and is “called back” at a later time. A higher-order function is one that accepts other functions as arguments and provides the logic for when the callback function is executed.

Question 20: Write a code to find all the possible permutations in which (n) people can occupy (r) a number of seats in a classroom.

//Permutations in which n people can occupy r seats
#include<stdio.h>
    
//function for factorial
int factorial(int num)
{
    int fact=1;
    for(int i=num; i>=1 ;i--)
        fact*=i;
    return fact;
}
    
//main program
int main()
{
    int n,r;
    printf("Enter number of people: ");
        
    //user input
    scanf("%d",&n);
    printf("Enter number of seats: ");
        
    //user input
    scanf("%d", &r);
        
    //finding all possible arrangements of n people on r seats
    // by using formula of permutation
    int p = factorial(r)/factorial(r-n);

    //printing output
    printf("Total possible arrangements: %d",p);

    return 0;
}

Unlock this article for Free,
by logging in

PayPal Technical Interview Questions