Filter interviews by
A structured approach to deploying Chrome updates across multiple systems efficiently.
Use Group Policy for Windows environments to manage Chrome updates centrally.
Implement a scheduled task to check for updates regularly.
Utilize the Google Update service to automate the update process.
Test updates in a controlled environment before wide deployment.
Monitor update success and failure rates using logging and reportin...
My goal is to continuously grow as a software developer, contribute to impactful projects, and enhance my skills in emerging technologies.
Aim to master new programming languages, such as Rust or Go, to broaden my development toolkit.
Seek opportunities to work on open-source projects to collaborate with other developers and learn from their expertise.
Aspire to take on leadership roles in future projects, guiding ju...
LRU cache algorithm evicts the least recently used items first to optimize memory usage and improve access speed.
Eviction Policy: LRU removes the least recently accessed items when the cache reaches its limit, ensuring frequently used items remain available.
Implementation: Typically implemented using a combination of a hash map for fast access and a doubly linked list to maintain the order of usage.
Example: If a c...
Dijkstra's algorithm finds the shortest path between nodes in a graph, using a priority queue for efficient pathfinding.
Graph Representation: Dijkstra's algorithm works on weighted graphs, where edges have non-negative weights, representing distances or costs.
Initialization: Start with a source node, setting its distance to zero and all other nodes to infinity, indicating they are unreachable initially.
Priority Qu...
Find pairs of indices in an array where the difference between the value and index is the same for both.
Understanding the Condition: We need to find pairs (i, j) such that ARR[i] - i = ARR[j] - j.
Using a Hash Map: Store the results of ARR[k] - k in a hash map to track indices with the same value.
Example: For ARR = [3, 1, 2, 3], ARR[0]-0=3, ARR[1]-1=0, ARR[2]-2=0, ARR[3]-3=0. Pairs are (1, 2), (1, 3), (2, 3).
Iterat...
Find the Kth largest and Kth smallest elements in an array of integers efficiently.
Sort the array and access the Kth elements directly. Example: For [3, 1, 5, 2], K=2 gives 2nd largest=3, 2nd smallest=2.
Use a min-heap for Kth largest and a max-heap for Kth smallest. This is efficient for large arrays.
Consider edge cases: If K is larger than the array size, return an error or a specific value.
For duplicates, decide...
I have a solid understanding of computer networks, including protocols, architectures, and security measures.
Familiar with OSI and TCP/IP models, understanding how data flows through layers.
Experience with network protocols like HTTP, FTP, and DNS.
Knowledge of network devices such as routers, switches, and firewalls.
Understanding of IP addressing, subnetting, and network segmentation.
Experience with network troubl...
I am proficient in several programming languages, each suited for different tasks and projects in software development.
JavaScript: Used for web development, both front-end (React, Angular) and back-end (Node.js).
Python: Great for data analysis, machine learning (using libraries like Pandas, TensorFlow), and web development (Django, Flask).
Java: Commonly used for enterprise applications, Android development, and la...
Object-Oriented Programming (OOP) is a programming paradigm based on objects and classes to structure software design.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism to create a new class using properties and methods of an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present the same interfac...
A DBMS (Database Management System) is software that enables the creation, management, and manipulation of databases.
Types of DBMS: Relational (e.g., MySQL, PostgreSQL), NoSQL (e.g., MongoDB, Cassandra).
Functions: Data storage, retrieval, and manipulation.
Data integrity and security: Ensures data accuracy and restricts unauthorized access.
Examples of use: Banking systems, e-commerce platforms, and inventory manage...
I appeared for an interview in Jan 2025, where I was asked the following questions.
I am a software developer with 5 years of experience in Java, Python, and SQL.
5 years of experience in Java, Python, and SQL
Worked on developing web applications using Java Spring framework
Proficient in database management with SQL
I applied via Campus Placement
A tree is a hierarchical data structure consisting of nodes, with a root node and child nodes, used to represent relationships.
A tree consists of nodes connected by edges.
The top node is called the root, and nodes without children are leaves.
Trees can be binary (each node has at most two children) or n-ary (nodes can have n children).
Common types include binary trees, binary search trees, and AVL trees.
Example: A famil...
Hashing is a technique used to convert data into a fixed-size value for efficient data retrieval and storage.
Hash functions take input data and produce a hash code, e.g., SHA-256.
Hash tables use key-value pairs for fast data access, e.g., storing user data by user ID.
Collisions occur when different inputs produce the same hash; techniques like chaining or open addressing resolve this.
Hashing is widely used in data stru...
I applied via AmbitionBox and was interviewed in Apr 2024. There were 3 interview rounds.
An aptitude test is an exam used to determine an individual's skill or propensity to succeed in a given activity.
Java is platform independent due to its bytecode and JVM implementation.
Java code is compiled into bytecode, which can run on any platform with a Java Virtual Machine (JVM)
JVM acts as an interpreter, translating bytecode into machine code specific to the underlying platform
This allows Java programs to be written once and run anywhere, without the need for recompilation
Static binding is resolved at compile time, while dynamic binding is resolved at runtime.
Static binding is also known as early binding, where the method call is resolved at compile time based on the type of the object.
Dynamic binding is also known as late binding, where the method call is resolved at runtime based on the actual type of the object.
Example of static binding: method overloading.
Example of dynamic binding:...
JVM is a virtual machine that enables a computer to run Java programs.
JVM is platform-independent and converts Java bytecode into machine code.
It consists of class loader, runtime data areas, execution engine, and native method interface.
JVM manages memory, garbage collection, and exception handling.
Examples of JVM implementations include Oracle HotSpot, OpenJ9, and GraalVM.
Lambda expression in JAVA is a concise way to represent a method implementation using a functional interface.
Lambda expressions are used to provide a more concise way to implement functional interfaces in JAVA.
They are similar to anonymous classes but with less boilerplate code.
Lambda expressions can be used to pass behavior as an argument to a method.
Syntax: (parameters) -> expression or (parameters) -> { statements; ...
Multi-source BFS on an array of strings involves finding the shortest path from multiple starting points to a target point.
Implement BFS algorithm to traverse the array of strings starting from multiple sources simultaneously.
Maintain a queue of nodes to visit next, and keep track of visited nodes to avoid revisiting.
Update the distance of each node from the sources as you traverse the array.
Example: Given an array of ...
I appeared for an interview in May 2025, where I was asked the following questions.
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Developed a web application for online shopping with user authentication and payment gateway integration.
Implemented user authentication using JWT tokens
Integrated Stripe API for payment processing
Designed responsive UI using React and Bootstrap
Utilized Node.js for backend development
DSA hard of dp and tree and graph, segments
DSA medium questions were asked in the interview
Test was conducted online on HAckerrank platform
A HashMap is a data structure that stores key-value pairs. To find all buddies in a HashMap, we need to iterate through the entries and compare values.
Iterate through the entries of the HashMap
Compare values to find buddies
Store buddies in an array of strings
I appeared for an interview in Mar 2025, where I was asked the following questions.
I bring a unique blend of skills, experience, and passion for software development that aligns perfectly with your team's goals.
Proven experience in developing scalable applications, such as a recent project where I improved performance by 30%.
Strong problem-solving skills demonstrated through successful debugging of complex issues in previous roles.
Excellent teamwork and communication abilities, as shown by my role in...
Top trending discussions
Some of the top questions asked at the Google Software Developer interview -
The duration of Google Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 121 interview experiences
Difficulty level
Duration
based on 141 reviews
Rating in categories
Software Engineer
3k
salaries
| ₹33 L/yr - ₹65 L/yr |
Software Developer
2.1k
salaries
| ₹33.2 L/yr - ₹61.6 L/yr |
Senior Software Engineer
1.2k
salaries
| ₹35.9 L/yr - ₹70 L/yr |
Sde1
398
salaries
| ₹32.6 L/yr - ₹60 L/yr |
Data Scientist
379
salaries
| ₹26.8 L/yr - ₹50 L/yr |
Yahoo
Amazon
Microsoft Corporation