Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Uber Sde1 Interview Questions and Answers

Updated 12 Jun 2023

Uber Sde1 Interview Experiences

1 interview found

Sde1 Interview Questions & Answers

user image Anonymous

posted on 12 Jun 2023

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in May 2023. 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 - Coding Test 

Very Easy questions just do it

Round 3 - One-on-one 

(4 Questions)

  • Q1. What is your introduction
  • Q2. Why SDE 1 only not SDE 2
  • Ans. 

    SDE 1 is an entry-level position where candidates gain foundational skills before advancing to SDE 2.

    • SDE 1 focuses on learning and building foundational skills in software development.

    • SDE 2 requires more experience and expertise in software development.

    • Advancing from SDE 1 to SDE 2 is a common career progression in tech companies.

    • SDE 1 roles often involve working on smaller projects or components of larger projects.

    • SDE...

  • Answered by AI
  • Q3. If bully happens will you bully someone
  • Ans. 

    No, I believe in standing up against bullying and supporting those who are being bullied.

    • I do not support bullying in any form and believe in treating others with respect and kindness.

    • I would try to intervene and help the person being bullied, either by talking to the bully or seeking help from a teacher or supervisor.

    • I believe in creating a positive and inclusive environment where everyone feels safe and respected.

  • Answered by AI
  • Q4. If taken leave can you work 7 days a week

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep yourself you only and you will get a wholesome of 60 LPA

Rate your
company

🤫 100% anonymous

How was your last interview experience?

Share interview

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

Paytm user image Anonymous

posted on 20 Aug 2022

I applied via Company Website and was interviewed before Aug 2021. There were 2 interview rounds.

Round 1 - Coding Test 

Easy level questions

Round 2 - Technical 

(1 Question)

  • Q1. Oops,DBMS,os,dsa, difference between pointers and references

Interview Preparation Tips

Interview preparation tips for other job seekers - Do DSA very well
Don't ignore core computer subjects and all
Try standard problems of DSA atleast twice,can refer to strivers sde sheet
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jan 2024. There were 3 interview rounds.

Round 1 - Coding Test 

1 HR of coding round, 2 problems asked. One on stack, one on DP.

Round 2 - Coding Test 

Machine coding round where LLD implementation of a cab booking system was asked.

Round 3 - Behavioral 

(2 Questions)

  • Q1. Past projects were discussed at length
  • Q2. Behavioural questions were asked

Sde1 Interview Questions & Answers

Ola Cabs user image Anonymous

posted on 20 Jun 2021

I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Write a react js parent and child components and show how passing props work?
  • Ans. 

    Example of React parent and child components with props

    • Create a parent component with state and pass it as props to child component

    • Access the props in child component using 'props' keyword

    • Update the parent state from child component using a callback function passed as prop

    • Example: Parent component -

    • Example: Child component -

  • Answered by AI
  • Q2. What is closure in JS?
  • Ans. 

    Closure is a function that has access to its outer function's variables, even after the outer function has returned.

    • Closure is created when a function returns another function.

    • The inner function has access to the outer function's variables.

    • Closure is used to create private variables and methods.

    • Example: function outer() { let x = 10; return function inner() { console.log(x); } }

    • Example: let closureFunc = outer(); closu

  • Answered by AI
  • Q3. Explain currying in JS? sum(1)(2)(); sum(2)(4)(); All these should return sum of numbers
  • Ans. 

    Currying is a technique of transforming a function that takes multiple arguments into a sequence of functions that each take a single argument.

    • Currying is achieved by returning a function that takes the next argument until all arguments are received.

    • In JavaScript, currying is often used for partial application of functions.

    • The sum function in the example takes one argument and returns a function that takes the next arg...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn fundamentals about JS

Skills evaluated in this interview

Sde1 Interview Questions & Answers

Swiggy user image Anonymous

posted on 16 Jul 2024

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Design splitwise. Low Level question. More like Machine Coding

Round 2 - Coding Test 

Question on Strings and DP

Round 3 - HM Round 

(2 Questions)

  • Q1. DynamoDB Working
  • Q2. General Discussion regarding projects in previous firm

Sde1 Interview Questions & Answers

Blinkit user image Anonymous

posted on 14 Jan 2025

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Coding Test 

Hackerrank - 3 questions 2 hrs

Sde1 Interview Questions & Answers

Swiggy user image Anonymous

posted on 6 Feb 2023

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Referral and was interviewed before Feb 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all Resume tips
Round 2 - HR 

(2 Questions)

  • Q1. Asked Likes and dislikes
  • Q2. Question related to company

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn and grow, and work hard and work hard , Make

Sde1 Interview Questions & Answers

Paytm user image Anonymous

posted on 9 Dec 2022

I applied via Campus Placement

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 

3 questions 1 is easy and 2 medium problems

Round 3 - Technical 

(2 Questions)

  • Q1. Check whether a linked list is palindrome
  • Ans. 

    Check if a linked list is palindrome

    • Traverse the linked list and push each element onto a stack

    • Traverse the linked list again and compare each element with the top of the stack

    • If all elements match, the linked list is a palindrome

  • Answered by AI
  • Q2. Diameter of a binary tree
  • Ans. 

    The diameter of a binary tree is the longest path between any two leaf nodes.

    • Calculate the height of left and right subtrees recursively

    • Find the diameter of left and right subtrees

    • Compare the diameter of left and right subtrees and return the maximum

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - follow gfg,leetcode.do problems in leetcode,coding ninjas.

Skills evaluated in this interview

Sde1 Interview Questions & Answers

Paytm user image Anonymous

posted on 29 Jul 2023

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Coding Test 

3 questions were asked. 1 easy 1 medium 1 hard

Round 3 - Coding Test 

One on one coding round. Basic easy to medium coding questions were asked

Round 4 - One-on-one 

(2 Questions)

  • Q1. Some coding questions and CS fundamentals were asked
  • Q2. Projects I had worked on in college
Round 5 - HR 

(1 Question)

  • Q1. Basic HR questions were asked

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice leetcode top 150 interview questions.
Contribute & help others!
anonymous
You can choose to be anonymous

Uber Interview FAQs

How many rounds are there in Uber Sde1 interview?
Uber interview process usually has 3 rounds. The most common rounds in the Uber interview process are Resume Shortlist, Coding Test and One-on-one Round.
What are the top questions asked in Uber Sde1 interview?

Some of the top questions asked at the Uber Sde1 interview -

  1. If bully happens will you bully some...read more
  2. Why SDE 1 only not SD...read more

Recently Viewed

DESIGNATION

DESIGNATION

INTERVIEWS

WebMD

No Interviews

Tell us how to improve this page.

Uber Sde1 Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more

Tesco

Secure your future with a company that values your job stability.

Sde1 Interview Questions from Similar Companies

Amazon Sde1 Interview Questions
4.1
 • 30 Interviews
Paytm Sde1 Interview Questions
3.3
 • 3 Interviews
Swiggy Sde1 Interview Questions
3.8
 • 2 Interviews
Flipkart Sde1 Interview Questions
4.0
 • 2 Interviews
Blinkit Sde1 Interview Questions
3.7
 • 1 Interview
Meesho Sde1 Interview Questions
3.7
 • 1 Interview
Zepto Sde1 Interview Questions
3.5
 • 1 Interview
View all
Uber Sde1 Salary
based on 37 salaries
₹25 L/yr - ₹77 L/yr
109% more than the average Sde1 Salary in India
View more details

Uber Sde1 Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Driver
584 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

CAR Driver
361 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
157 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Executive
136 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst
134 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Uber with

Amazon

4.1
Compare

Google

4.4
Compare

Ola Cabs

3.4
Compare

Airbnb

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent