Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2021. There were 3 interview rounds.
DS & Algo based programming
Salesforce Apex coding also making use Queue and Recursive algo.
posted on 19 Nov 2024
I applied via Approached by Company and was interviewed in Feb 2024. There were 4 interview rounds.
Print all possible combinations of strings by picking one character from each string in the array.
Iterate through each character of the first string and combine it with each character of the second string.
Repeat the process for all strings in the array to get all possible combinations.
Use nested loops to generate combinations efficiently.
Check if a string has balanced parentheses.
Use a stack to keep track of opening parentheses.
Iterate through the string and push opening parentheses onto the stack.
When a closing parenthesis is encountered, pop from the stack and check if it matches the closing parenthesis.
If stack is empty at the end and all parentheses are matched, the string has balanced parentheses.
Modified Balanced Parentheses where characters can be matched with any other character.
Use a stack to keep track of opening characters
When encountering a closing character, check if it matches the top of the stack
If it matches, pop from the stack, else return false
Continue until end of string, return true if stack is empty
Java program to calculate date n days after given date without using Date parsing libraries.
Parse the input date string to extract day, month, and year components.
Calculate the total number of days represented by the input date.
Add the specified number of days to the total days calculated.
Convert the final total days back to day, month, and year components to get the new date.
Print Pythagorean triplets within a given range.
Iterate through all possible combinations of a, b, and c within the given range
Check if a^2 + b^2 = c^2 for each combination
Print the triplets that satisfy the Pythagorean theorem
Use backtracking to find all combinations of numbers in an array that sum up to a given number.
Start by sorting the array in non-decreasing order to easily identify combinations.
Use backtracking to recursively find all combinations that sum up to the target number.
Keep track of the current combination and the remaining sum as you traverse the array.
Add the current combination to the result when the sum equals the targe
posted on 20 Jun 2024
React DOM is a package that provides methods for updating the DOM in response to React components.
React DOM is used to render React components to the DOM.
It provides methods like ReactDOM.render() to render components.
React DOM efficiently updates the DOM when the state of a component changes.
It handles events and updates the DOM accordingly.
React DOM is separate from React itself, allowing for flexibility in rendering
MVC in Rails is a software design pattern that separates the application into three main components: Model, View, and Controller.
Model: Represents the data and business logic of the application.
View: Represents the user interface of the application.
Controller: Acts as an intermediary between the Model and View, handling user input and updating the Model accordingly.
Example: In a Rails application, a User model would ha...
posted on 12 Oct 2020
I applied via Recruitment Consultant and was interviewed before Oct 2019. There were 4 interview rounds.
EXIST checks for the existence of a value in a subquery, while IN checks for the existence of a value in a list.
EXIST is used with a subquery, while IN is used with a list of values.
EXIST returns true if the subquery returns any rows, while IN returns true if the value is found in the list.
EXIST is more efficient for large datasets, while IN is more efficient for small datasets.
Example: SELECT * FROM table1 WHERE colum...
INDEX and PARTITION are database optimization techniques that improve query performance.
INDEX is a data structure that improves the speed of data retrieval operations on a database table.
PARTITION is a technique that divides a large table into smaller, more manageable parts.
INDEX and PARTITION can be used together to further improve query performance.
Examples of INDEX include B-tree, hash, and bitmap indexes.
Examples o...
Removing duplicates using analytical functions in SQL
Use the ROW_NUMBER() function to assign a unique number to each row
Partition the data by the columns that define duplicates
Order the data by the same columns
Filter out rows with a row number greater than 1
Oracle DB Architecture is a multi-layered design consisting of physical, logical, and memory structures.
Physical layer includes data files, redo logs, and control files
Logical layer includes tablespaces, schema objects, and segments
Memory structures include SGA and PGA
Oracle uses a client-server architecture with a listener process
Oracle also supports RAC (Real Application Clusters) for high availability and scalabilit
ANSI JOINS are standard SQL joins while Oracle JOINS are specific to Oracle database.
ANSI JOINS are supported by most relational databases while Oracle JOINS are specific to Oracle.
ANSI JOINS use keywords like INNER JOIN, LEFT JOIN, RIGHT JOIN, etc. while Oracle JOINS use symbols like (+) for outer joins.
ANSI JOINS are more portable and easier to migrate to other databases while Oracle JOINS are more efficient in Oracl...
I applied via Campus Placement
Use a built-in function or algorithm to find the square root of a number up to 2 decimal places.
Use a programming language's built-in function like sqrt() in Python or Math.sqrt() in JavaScript to find the square root of a number.
If a built-in function is not available, implement an algorithm like Newton's method to approximate the square root.
Round the result to 2 decimal places using a function like round() or toFixe
To find the longest path in a binary tree (leaf to leaf), we need to perform a depth-first search and keep track of the maximum path length.
Perform a depth-first search on the binary tree, keeping track of the maximum path length encountered so far.
At each node, calculate the maximum path length by adding the maximum left and right subtree depths.
Update the maximum path length if the current path length is greater.
Repe...
posted on 20 Jun 2024
Write code for micro service
Singleton is a design pattern that restricts the instantiation of a class to one object.
Singleton pattern ensures that a class has only one instance and provides a global point of access to it.
Commonly used in scenarios where only a single instance of a class is needed, such as database connections or configuration settings.
Implementation can involve a private constructor, a static method to access the instance, and a ...
I applied via Company Website and was interviewed in Dec 2023. There were 2 interview rounds.
based on 6 reviews
Rating in categories
Software Engineer
1.3k
salaries
| ₹21 L/yr - ₹80 L/yr |
Software Developer
1.1k
salaries
| ₹21.8 L/yr - ₹56.7 L/yr |
Senior Software Engineer
622
salaries
| ₹24 L/yr - ₹87.3 L/yr |
Sde1
254
salaries
| ₹14 L/yr - ₹55 L/yr |
Data Scientist
248
salaries
| ₹25.7 L/yr - ₹52.2 L/yr |
Yahoo
Amazon
Microsoft Corporation