Upload Button Icon Add office photos

Filter interviews by

Clear (1)

RaRa Delivery Sde1 Interview Questions, Process, and Tips

Updated 27 Apr 2022

Top RaRa Delivery Sde1 Interview Questions and Answers

  • Q1. DSA and Language Questions: 1. Difference between Arrays and ArrayList in Java. 2. Queue Implementation using Linked List. 3. BST- How would you fill a BST with a sorted ...read more
  • Q2. During Binary search, what if negative elements were there in an Array as well how would you search a specific element and time complexity for the same.
  • Q3. Two uniform wires totally burnt in a total of 30 minutes. How will you measure 45 minutes?
View all 18 questions

RaRa Delivery Sde1 Interview Experiences

2 interviews found

Sde1 Interview Questions & Answers

user image Anonymous

posted on 19 Apr 2022

I applied via Company Website

Round 1 - Technical 

(19 Questions)

  • Q1. Difference between Arrays & ArrayLists in Java?
  • Ans. 

    Arrays are fixed in size while ArrayLists can dynamically grow or shrink.

    • Arrays are of fixed size while ArrayLists can be resized dynamically.

    • Arrays can hold primitive data types while ArrayLists can only hold objects.

    • Arrays are faster than ArrayLists for accessing elements.

    • ArrayLists have built-in methods for adding, removing, and sorting elements.

    • Example: int[] arr = new int[5]; ArrayList list = new ArrayList<>();

  • Answered by AI
  • Q2. Queue Implementation using Linked List?
  • Ans. 

    Queue can be implemented using a singly linked list where insertion happens at the tail and deletion at the head.

    • Create a Node class with data and next pointer

    • Create a Queue class with head and tail pointers

    • Enqueue operation: create a new node and add it to the tail of the list

    • Dequeue operation: remove the node at the head of the list and update the head pointer

    • Peek operation: return the data at the head of the list wi

  • Answered by AI
  • Q3. BST- How will you fill a BST with a sorted Array?
  • Ans. 

    To fill a BST with a sorted array, we can use a recursive approach.

    • Find the middle element of the array and make it the root of the BST

    • Recursively construct the left subtree using the left half of the array

    • Recursively construct the right subtree using the right half of the array

  • Answered by AI
  • Q4. Random pointers linked- list clone?
  • Q5. Fibonacci number generation using recursion.
  • Ans. 

    Fibonacci number generation using recursion

    • Define a function that takes an integer as input

    • If the input is 0 or 1, return the input

    • Else, return the sum of the function called with input-1 and input-2

    • Call the function with the desired input

  • Answered by AI
  • Q6. What is the fastest sorting algorithm?
  • Ans. 

    The fastest sorting algorithm is QuickSort.

    • QuickSort has an average time complexity of O(n log n).

    • It is a divide and conquer algorithm that recursively partitions the array.

    • It is widely used in practice and has many variations such as randomized QuickSort.

    • Other fast sorting algorithms include MergeSort and HeapSort.

  • Answered by AI
  • Q7. Clone a linked list with a random pointer.
  • Ans. 

    Clone a linked list with a random pointer.

    • Create a new node for each node in the original list

    • Store the mapping of original node to new node in a hash table

    • Set the random pointer of each new node based on the mapping

    • Traverse the original list and the new list simultaneously to set the next pointers

  • Answered by AI
  • Q8. Print Fibonacci numbers until the nth term using only recursion (no loop allowed)
  • Ans. 

    Printing Fibonacci numbers using recursion only

    • Define a recursive function that takes two arguments, n and a list to store the Fibonacci sequence

    • Base case: if n is 0 or 1, return the list

    • Recursive case: append the sum of the last two elements in the list to the list and call the function with n-1

    • Call the function with n and an empty list to start the sequence

    • Print the list of Fibonacci numbers

  • Answered by AI
  • Q9. Show reflection in java.
  • Ans. 

    Reflection in Java allows inspection and modification of runtime behavior of a program.

    • Reflection is achieved through classes in the java.lang.reflect package.

    • It allows access to class information, constructors, methods, and fields at runtime.

    • Reflection can be used to create new objects, invoke methods, and access or modify fields.

    • Example: Class c = Class.forName("java.lang.String");

    • Example: Method m = c.getDeclared

  • Answered by AI
  • Q10. Random Pointer questions
  • Q11. Print pair with given sum.
  • Ans. 

    Given an array of integers and a target sum, find a pair of integers that add up to the target sum.

    • Create a hash table to store the difference between the target sum and each element in the array

    • Iterate through the array and check if the current element is present in the hash table

    • If it is, return the current element and its corresponding hash table value as the pair that adds up to the target sum

    • If no such pair is fou

  • Answered by AI
  • Q12. How does Binary search be done in a rotated array?
  • Ans. 

    Binary search in a rotated array can be done by finding the pivot point and then applying binary search on the two subarrays.

    • Find the pivot point by comparing mid element with the first and last elements of the array

    • Apply binary search on the two subarrays formed by the pivot point

    • Repeat until the element is found or the subarray is empty

    • Time complexity is O(log n)

    • Example: [4,5,6,7,0,1,2], target=0. Pivot point is 3. B

  • Answered by AI
  • Q13. Binary search method
  • Q14. During Binary search, what if negative elements were there in an Array as well how would you search a specific element and time complexity for the same.
  • Ans. 

    Negative elements in array won't affect binary search. Time complexity remains O(log n).

    • Binary search works by dividing the array into two halves and comparing the middle element with the target element.

    • If the middle element is greater than the target, search in the left half, else search in the right half.

    • Negative elements won't affect this process as long as the array is sorted.

    • Time complexity remains O(log n) as the

  • Answered by AI
  • Q15. Show the Array Rotation
  • Ans. 

    Array rotation is the process of shifting the elements of an array to the left or right.

    • To rotate an array to the left, move the first element to the end of the array and shift the remaining elements to the left.

    • To rotate an array to the right, move the last element to the beginning of the array and shift the remaining elements to the right.

    • The number of rotations can be specified by the user.

    • Example: If the array is [...

  • Answered by AI
  • Q16. Polymorphism with Example
  • Ans. 

    Polymorphism is the ability of an object to take on many forms. It allows objects of different classes to be treated as if they were of the same class.

    • Polymorphism is achieved through method overriding and method overloading.

    • Method overriding is when a subclass provides its own implementation of a method that is already provided by its parent class.

    • Method overloading is when a class has two or more methods with the sam...

  • Answered by AI
  • Q17. Overloading vs Overriding
  • Ans. 

    Overloading is having multiple methods with the same name but different parameters. Overriding is having a method in the subclass with the same name and parameters as in the superclass.

    • Overloading is compile-time polymorphism while overriding is runtime polymorphism.

    • Overloading is used to provide different ways of calling the same method while overriding is used to provide a specific implementation of a method in the s...

  • Answered by AI
  • Q18. Plane & Fuel Puzzles .
  • Q19. Two uniform wires totally burnt in a total of 30 minutes. How will you measure 45 minutes?
Round 2 - Project 

(1 Question)

  • Q1. You may be asked about the project mentioned in your CV
Round 3 - Technical 

(2 Questions)

  • Q1. If there is a linked list and some of the nodes have a random pointer, pointing to a different node of the same list, randomly pointing to some other pointer. Your goal is to make a copy of this list, or c...
  • Q2. There will be a discussion after this round on your salary expectations
Round 4 - HR 

(3 Questions)

  • Q1. Why should we hire you?
  • Q2. What are your salary expectations?
  • Q3. Discussion on the what the company does.

Interview Preparation Tips

Topics to prepare for RaRa Delivery Sde1 interview:
  • DSA, OOPS, Puzzles
Interview preparation tips for other job seekers - DSA is extremely important. Linked list is a must. Keep a cool head during the interview, no need to be nervous. Be confident during the entire interview process. While explaining the approach, try and explain using small examples that would be great. If you are not confident about a problem you can say that you are not confident about that problem, no need to worry much about it, they will ask you another question instead. They want to check your DSA knowledge during the interview and the question were easy to medium level.

Skills evaluated in this interview

Sde1 Interview Questions & Answers

user image Anonymous

posted on 27 Apr 2022

Round 1 - Technical 

(3 Questions)

  • Q1. DSA and Language Questions: 1. Difference between Arrays and ArrayList in Java. 2. Queue Implementation using Linked List. 3. BST- How would you fill a BST with a sorted array. 4. Random pointer linked...
  • Ans. 

    A list of technical questions related to data structures and algorithms in Java.

    • Arrays are fixed in size while ArrayLists can dynamically grow and shrink.

    • Queue can be implemented using a linked list by adding elements to the end and removing from the front.

    • To fill a BST with a sorted array, we can recursively divide the array in half and add the middle element as the root.

    • Random pointer linked-list clone can be done by...

  • Answered by AI
  • Q2. OOPS: 1. Polymorphism with example 2. Overloading vs overriding
  • Ans. 

    Polymorphism is the ability of an object to take on many forms. Overloading is having multiple methods with the same name but different parameters. Overriding is having a method in a subclass with the same name and parameters as a method in the superclass.

    • Polymorphism allows objects to be treated as if they are of different types. For example, a parent class reference can be used to refer to a child class object.

    • Overlo...

  • Answered by AI
  • Q3. Puzzles: 1. Plane and Fuel Puzzle 2. Two uniform wires completely burned in a total of 30 mins. How will you measure 45 mins
Round 2 - Technical 

(1 Question)

  • Q1. DSA and Language questions: 1. If there is a Linked List and some of the nodes have a random pointer, pointing to a different node of the same list, randomly pointing to some other pointer. Your goal is t...
Round 3 - HR 

(1 Question)

  • Q1. The duration of this round is approximately 20-30 minutes. The discussion revolved around the work that the company does and how the work you will be doing and how they will distribute the salary and so on...

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA is extremely Important. Linked List is a must. Keep a cool head during the interview, no need to be nervous. Be Confident during the entire interview process. While explaining the approach, try and explain using small examples that would be great. If you are not confident about a problem you can say that you are not confident about that problem, no need to worry much about it, they will ask you another question instead. They want to check your DSA knowledge during the interview and the questions were easy to medium level.

Skills evaluated in this interview

Sde1 Interview Questions Asked at Other Companies

Q1. DSA and Language Questions: 1. Difference between Arrays and Arra ... read more
asked in Park Plus
Q2. 1. What is a doubly-linked list? And real-world applications.
asked in Amazon
Q3. pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent proces ... read more
Q4. Given one point and circle how will you find if it's inside circl ... read more
asked in Amazon
Q5. N queen problem with problem statement and dry running of code wi ... read more

Interview questions from similar companies

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 12 Aug 2017

I was interviewed in Aug 2017.

Interview Questionnaire 

16 Questions

  • Q1. -----/ But here the main thing is that handling of corner cases like when there are duplicate tickets and when there is no proper path possible with given tickets
  • Q2. N queen problem with problem statement and dry running of code with 4 queens and then writing the code
  • Ans. 

    N queen problem is to place N queens on an NxN chessboard without any two queens threatening each other.

    • The problem can be solved using backtracking algorithm

    • Start with placing a queen in the first row and move to the next row

    • If no safe position is found, backtrack to the previous row and try a different position

    • Repeat until all queens are placed or no safe position is found

    • Code can be written in any programming langua...

  • Answered by AI
  • Q3. Sub set problem(Check if there exists any sub array with given sum in the array ) . But the thing here is that we have to do it with space complexity of only O( 1 K ) . K is the sum given .
  • Ans. 

    Check if there exists any sub array with given sum in the array with O(1K) space complexity.

    • Use two pointers to traverse the array and maintain a current sum.

    • If the current sum is greater than the given sum, move the left pointer.

    • If the current sum is less than the given sum, move the right pointer.

    • If the current sum is equal to the given sum, return true.

  • Answered by AI
  • Q4. What is NP hardness .
  • Ans. 

    NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.

    • NP-hard problems are some of the most difficult problems in computer science.

    • They cannot be solved in polynomial time by any known algorithm.

    • Examples include the traveling salesman problem and the knapsack problem.

  • Answered by AI
  • Q5. What is the difference between references and pointers
  • Ans. 

    References and pointers are both used to access memory locations, but references cannot be null and cannot be reassigned.

    • Pointers can be null and can be reassigned to point to different memory locations.

    • References are automatically dereferenced, while pointers need to be explicitly dereferenced.

    • Pointers can perform arithmetic operations, while references cannot.

    • Example: int x = 5; int *ptr = &x; int &ref = x;

    • Example: i

  • Answered by AI
  • Q6. What is difference between reference variable and actual reference
  • Ans. 

    A reference variable is a variable that holds the memory address of an object, while an actual reference is the object itself.

    • A reference variable is declared with a specific type and can only refer to objects of that type.

    • An actual reference is the object itself, which can be accessed and manipulated using the reference variable.

    • Changing the value of a reference variable does not affect the original object, but changi...

  • Answered by AI
  • Q7. In this round he asked me about previous round questions and their time complexities also . and with every DS and Algo related questions they asked the time complexities
  • Q8. Segmentation , virtual memory , paging
  • Q9. 0-1 Knapsack problem
  • Q10. What happens when we type an URL
  • Ans. 

    When we type an URL, the browser sends a request to the server hosting the website and retrieves the corresponding webpage.

    • The browser parses the URL to extract the protocol, domain, and path.

    • It resolves the domain name to an IP address using DNS.

    • The browser establishes a TCP connection with the server.

    • It sends an HTTP request to the server.

    • The server processes the request and sends back an HTTP response.

    • The browser re

  • Answered by AI
  • Q11. Implementation of LRU (WIth Production level code)
  • Ans. 

    Implementation of LRU cache using a doubly linked list and a hash map.

    • LRU (Least Recently Used) cache is a data structure that stores a fixed number of items and evicts the least recently used item when the cache is full.

    • To implement LRU cache, we can use a doubly linked list to maintain the order of items based on their usage frequency.

    • We can also use a hash map to store the key-value pairs for quick access and retrie...

  • Answered by AI
  • Q12. Given page access sequence and we have to tell final output using different page replacement algorithms like FIFO , LRU etc
  • Q13. What is indexing in DBMS How do we maintain it
  • Ans. 

    Indexing in DBMS is a technique to improve query performance by creating a data structure that allows faster data retrieval.

    • Indexing is used to speed up data retrieval operations in a database.

    • It involves creating a separate data structure that maps the values of a specific column to their corresponding records.

    • This data structure is called an index.

    • Indexes are typically created on columns that are frequently used in s...

  • Answered by AI
  • Q14. B trees , B+ trees with examples
  • Ans. 

    B trees and B+ trees are data structures used for efficient storage and retrieval of data in databases.

    • B trees are balanced trees with a variable number of child nodes per parent node. They are commonly used in databases to store large amounts of data.

    • B+ trees are a variant of B trees where all data is stored in the leaf nodes, and the internal nodes only contain keys. They are commonly used in databases for indexing.

    • B...

  • Answered by AI
  • Q15. AVL trees with examples and their balancing
  • Ans. 

    AVL trees are self-balancing binary search trees. They maintain a balance factor to ensure height balance.

    • AVL trees are named after their inventors, Adelson-Velsky and Landis.

    • They are height-balanced, meaning the difference in height between left and right subtrees is at most 1.

    • Insertion and deletion operations may cause imbalance, which is corrected by rotations.

    • AVL trees have a worst-case time complexity of O(log n) ...

  • Answered by AI
  • Q16. Pid ={3,5,0,1} ppid ={5,4,2,2} process id(pid) ppid=parent process id let us say the process that we killed is 2 now we have to print 2,0,1 as 0,1 are child of 2 and suppose that if we have children f...
  • Ans. 

    Given a list of process IDs and their corresponding parent process IDs, print the IDs of all processes that are children of a specific process ID, and recursively kill all their children.

    • Iterate through the list of process IDs and parent process IDs

    • Check if the current process ID is the one to be killed

    • If yes, recursively find and print all its children

    • If a child has further children, recursively kill them as well

  • Answered by AI

Interview Preparation Tips

Round: WRITTEN
Experience: It is a written round .

We are given with 2 coding questions of 10 marks each .There is no negative marking for coding questions

1)Given a string you have to partition the string in such a manner that each part of the partitioned string is a palindrome in itself and you have to count the number of such partition

For eg: given string NITIN
N ITI N
N I T I N
NITIN
So output will be 3.

2)You are given with a large paragraph and N words.
You have to find a min length subparagraph of the paragraph which contain all those N words in any order. Here length of a paragraph is the count of words in the paragraph.

There are 20 MCQ's all are technical questions only majorly from DSA
Tips: Coding it comes from practice . And for aptitude be good at fundamentals like time complexities etc .

Round: Technical Interview
Experience: Some times luck in interview is also important .I was unable to solve the second question initially ,but later with the help of my interviewer I was able to solve it .
Tips: Even if you are not able to solve the question initially don't be panic it will definitely go well

Round: Technical Interview
Experience: There are so many other questions . But sorry to say that I don't remember all of them ,if I remember them at some other time I will again update it here .

This round interviewer was very nice person And he is very helpful in fact .
Tips: Have solid basics at all data structures and algorithms ,Operating Systems


Round: Technical Interview
Experience: This round is entirely about other CS subjects like OS , DBMS,Networking .

Here asked me do you know other CS subjects like compiler design etc .
But as I am from Electronics I told them that I don't know all those subjects
Tips: Be good at other Cs subjects also

Round: Technical Interview
Experience: I solved above question Using DFS .I constructed a Graph using given information . and I did DFS starting from Given process .In the graph I took each process as 1 Node and the corresponding parent child relationship between the process as edges .
Tips: They will give sufficient time for thinking of the solution . So don't worry immediately after seeing the question . First think well you will definitely get it

Skills: Algorithms And DataStructures, Algorithm Analysis, Operating Systems, Basic Knowledge Of DBMS, Networking Basics, Object Oriented Programming (OOP) Basics
College Name: MNIT

Skills evaluated in this interview

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 16 Nov 2021

I applied via Campus Placement and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Medium DSA questions based on trees, linked lists and 1 graph

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA was the only thing needed in my interview so being consistent with Leetcode, giving weekly contests(at least attempting Hard level qns even if not completing them) was really helpful.

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 11 Oct 2021

I applied via Referral and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. 2 variable variation of LIS
  • Ans. 

    2 variable variation of LIS

    • The problem involves finding the longest increasing subsequence in two arrays

    • Dynamic programming can be used to solve the problem

    • The time complexity of the solution is O(n^2)

    • Example: Given two arrays [1, 3, 5, 4] and [2, 4, 3, 5], the longest increasing subsequence is [3, 5]

    • Example: Given two arrays [10, 22, 9, 33, 21, 50, 41, 60] and [5, 24, 39, 60, 15, 28, 27, 40], the longest increasing su

  • Answered by AI
  • Q2. House robber 3
  • Ans. Solved it with top down dp
  • Answered Anonymously
  • Q3. Search in rotated sorted array
  • Ans. 

    Search for an element in a rotated sorted array.

    • Use binary search to find the pivot point where the array is rotated.

    • Compare the target element with the first element of the array to determine which half to search.

    • Perform binary search on the selected half to find the target element.

    • Time complexity: O(log n), Space complexity: O(1).

  • Answered by AI
  • Q4. First non repeating character in continuous character stream
  • Ans. 

    Find the first non-repeating character in a continuous character stream.

    • Use a hash table to keep track of character frequency.

    • Iterate through the stream and check if the current character has a frequency of 1.

    • If yes, return the character as the first non-repeating character.

    • If no non-repeating character is found, return null or a default value.

  • Answered by AI
  • Q5. One priority queue question

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare Data structures and algorithms well, Answer managerial questions using STAR methodologies.

Skills evaluated in this interview

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 3 Feb 2022

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Prepare from hackerrank array and trees problems

Interview Preparation Tips

Interview preparation tips for other job seekers - work on ds and algo as they focus more on this knowledge

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 21 Feb 2022

I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.

Round 1 - Coding Test 

Asked 2 questions
1. Find the strings with maximum pattern match in given array of strings
2. Find the shortest distance between two target elements in given array

Round 2 - Technical 

(1 Question)

  • Q1. 1. Find the contiguous sub array with max sum 2. Find the median of an array sorting is involved

Interview Preparation Tips

Topics to prepare for Amazon Sde1 interview:
  • Data St
  • Algorithms
Interview preparation tips for other job seekers - Completly asked questions related to DSA and practice medium and high level problems in geeksforgeeks and leetcode

Skills evaluated in this interview

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 9 Sep 2022

Round 1 - Coding Test 

It was a part of placement drive, 1st OA than interview. The OA round was super easy I was able to code in minutes.

Round 2 - Technical 

(1 Question)

  • Q1. 2 Questions were asked. 1. Linked List sorting. 2. DP question.

Interview Preparation Tips

Interview preparation tips for other job seekers - Basically they select on the bases of your behaviour, resume and personality.
Round 1 - Coding Test 
Round 2 - HR 

(1 Question)

  • Q1. Detailed discussion about your resume
Round 3 - Technical 

(1 Question)

  • Q1. Database related questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare Well be confident about the things you mentioned in your resume.

Sde1 Interview Questions & Answers

Amazon user image Anonymous

posted on 2 Nov 2022

I applied via Company Website and was interviewed before Nov 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

General Leet Code Question and it was easy

Round 3 - Coding Test 

General coding question which was from difficult

Interview Preparation Tips

Topics to prepare for Amazon Sde1 interview:
  • leetcode
  • Python
Interview preparation tips for other job seekers - Prepare Amazon Principles and also leet code.
Good to know system designs and more.
Contribute & help others!
anonymous
You can choose to be anonymous

RaRa Delivery Interview FAQs

How many rounds are there in RaRa Delivery Sde1 interview?
RaRa Delivery interview process usually has 3-4 rounds. The most common rounds in the RaRa Delivery interview process are Technical and HR.
What are the top questions asked in RaRa Delivery Sde1 interview?

Some of the top questions asked at the RaRa Delivery Sde1 interview -

  1. DSA and Language Questions: 1. Difference between Arrays and ArrayList in Java...read more
  2. During Binary search, what if negative elements were there in an Array as well ...read more
  3. Two uniform wires totally burnt in a total of 30 minutes. How will you measure ...read more

Recently Viewed

INTERVIEWS

Amazon

40 top interview questions

LIST OF COMPANIES

Discover companies

Find best workplace

LIST OF COMPANIES

Discover companies

Find best workplace

LIST OF COMPANIES

Discover companies

Find best workplace

REVIEWS

Amazon

No Reviews

REVIEWS

Amazon

No Reviews

SALARIES

Viacom18 Media

No Salaries

COMPANY BENEFITS

Viacom18 Media

No Benefits

INTERVIEWS

Amazon

No Interviews

SALARIES

Zee Entertainment Enterprises

No Salaries

Tell us how to improve this page.

Sde1 Interview Questions from Similar Companies

Amazon Sde1 Interview Questions
4.1
 • 30 Interviews
Accenture Sde1 Interview Questions
3.8
 • 3 Interviews
TCS Sde1 Interview Questions
3.7
 • 2 Interviews
Jio Sde1 Interview Questions
3.9
 • 2 Interviews
Flipkart Sde1 Interview Questions
4.0
 • 2 Interviews
Infosys Sde1 Interview Questions
3.6
 • 1 Interview
BYJU'S Sde1 Interview Questions
3.1
 • 1 Interview
View all
Software Development Engineer
4 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Product Manager
4 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
4 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

HR Associate
3 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare RaRa Delivery with

TCS

3.7
Compare

Accenture

3.8
Compare

Wipro

3.7
Compare

Cognizant

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview