Filter interviews by
I applied via Referral and was interviewed in Nov 2022. There were 3 interview rounds.
JavaScript Based on some Questions
Top trending discussions
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
Decorator in Python is a design pattern that allows adding new functionality to an existing object without modifying its structure.
Decorators are functions that take another function as an argument and extend its behavior without explicitly modifying it.
They are commonly used to add logging, timing, caching, or authentication to functions.
Syntax for using decorators in Python involves using the @ symbol followed by the...
yield is a keyword in Python used in generator functions to return a value without terminating the function
yield is used in generator functions to produce a series of values over time
When a generator function is called, it returns an iterator object but does not start execution immediately
Each time the yield statement is reached, the function's state is saved, and the value is returned to the caller
Execution of the fun...
Patch is used to update a specific part of a resource, while put is used to replace the entire resource.
Patch is used for partial updates, while put is used for full updates.
Patch is idempotent, meaning multiple identical patch requests will have the same effect as a single request, while put is not necessarily idempotent.
Example: Using patch to update the title of a blog post without affecting other fields, while usin...
I applied via Company Website and was interviewed in Apr 2024. There was 1 interview round.
I am a software developer with 5 years of experience in Java and Python.
Experienced in Java and Python programming languages
Worked on various projects involving web development and data analysis
Familiar with Agile methodologies and version control systems like Git
I applied via Approached by Company and was interviewed before Oct 2023. There were 2 interview rounds.
Dynamic Programming problem involving finding the maximum sum of non-adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index.
At each index, the maximum sum is either the current element plus the sum two indices back, or the sum at the previous index.
Example: For array [2, 4, 6, 2, 5], the maximum sum of non-adjacent elements is 13 (2 + 6 + 5).
Find the longest common prefix among an array of strings.
Iterate through the characters of the first string and compare with other strings
Return the prefix when characters don't match or reach end of any string
Example: Input - ['flower', 'flow', 'flight'], Output - 'fl'
LRU cache is a data structure that stores the most recently used items.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hashmap to quickly access items in the cache.
When a new item is accessed, move it to the front of the linked list.
If the cache is full, remove the least recently used item from the end of the linked list.
I applied via Indeed and was interviewed in Oct 2023. There was 1 interview round.
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
posted on 6 Jun 2024
30 min .. time, speed, distance
Normal easy qus via leetcode
Accounts & Finance Executive
4
salaries
| ₹2.6 L/yr - ₹3.6 L/yr |
Executive Accountant
4
salaries
| ₹2.3 L/yr - ₹3.4 L/yr |
Documentation Executive
4
salaries
| ₹1.8 L/yr - ₹3 L/yr |
DHL Express
FedEx Express
Blue Dart Express
GATI-KWE