Filter interviews by
Fetch and parse txt data from API to return requested keys
Use an API request to fetch the txt data
Parse the txt data to extract values of requested keys
Return the values of the requested keys
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.
Create a table of Manager-Employee, add rows, and write queries.
Create a table named 'ManagerEmployee' with columns 'ManagerID' and 'EmployeeID'
Add rows to the table to represent the relationship between managers and employees
Write queries to retrieve information such as employees reporting to a specific manager
I applied via Campus Placement and was interviewed in Aug 2024. There were 3 interview rounds.
Arrays and strings, trees
Check if two strings are anagrams by comparing the sorted characters in each string.
Sort the characters in both strings and compare if they are equal.
Ignore spaces and punctuation when comparing the strings.
Example: 'listen' and 'silent' are anagrams.
Example: 'hello' and 'world' are not anagrams.
Tally Solutions is a software company that provides accounting and business management software solutions.
Tally Solutions offers software for financial accounting, inventory management, payroll, and more
It is widely used by small and medium-sized businesses for managing their finances
Tally software helps in generating reports, tracking expenses, and ensuring compliance with tax regulations
posted on 11 Sep 2024
It was online , evryone cheated , and even solving all the questions wont get you shortlisted
Dynamic memory allocation in C allows for allocating memory at runtime, enabling flexibility in memory usage.
Use functions like malloc(), calloc(), and realloc() to dynamically allocate memory in C.
Remember to free the allocated memory using free() to prevent memory leaks.
Dynamic memory allocation is commonly used for creating arrays or structures of unknown size at compile time.
I applied via Approached by Company and was interviewed in May 2024. There were 2 interview rounds.
1 hr coding round required me to solve 2 leetcode medium questions
Design an online grocery store similar to zepto.
Implement user-friendly interface for easy navigation
Include search functionality for quick product discovery
Offer secure payment options for customer convenience
Provide delivery options with tracking feature
Include customer reviews and ratings for products
Implement inventory management system for real-time updates
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Reverse a given Linked List with O(1) and O(N) space complexity.
For O(1) space complexity, use three pointers to reverse the links in place.
For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.
Be careful with edge cases such as empty list or list with only one node.
Find the celebrity in a party of N people where only one person is known to everyone.
The celebrity doesn't know anyone in the party.
We can use a stack to keep track of potential celebrities.
If a person knows someone, they cannot be a celebrity.
If a person doesn't know someone, we can push them onto the stack.
After iterating through all people, we check if the stack has only one person and if that person is known to eve
Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.
Merge Sort divides the array into two halves, sorts them recursively, and then merges them.
Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).
Merge Sort ...
Compute amount of water trapped in an elevation map after raining
Iterate through the array and find the maximum height on the left and right of each bar
Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar
Add up the amount of water trapped on each bar to get the total amount of water trapped
Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.
Use a stack to keep track of nodes to be visited.
For each level, alternate between adding nodes to the stack from left to right and right to left.
Pop nodes from the stack and add their children to the stack in the appropriate order.
Repeat until all nodes have been visited.
Sort a dictionary by key or value in ascending/descending order.
Use sorted() function with lambda function to sort by key or value.
For ascending order, use reverse=False and for descending order, use reverse=True.
Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)
I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.
Quick sort is a divide and conquer algorithm that sorts the array by selecting a pivot element and partitioning the other elements around it. Merge sort is also a divide and conquer algorithm that divides the array into two halves, sorts them separately and then merges them.
Quick sort has an average time complexity of O(n log n) while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is an in-place...
System design for Naukri.com platform
Identify user requirements and design the system architecture accordingly
Use scalable and reliable technologies for high traffic handling
Implement features like job search, job posting, resume upload, etc.
Ensure data security and privacy of users
Integrate with third-party services like payment gateways, social media platforms, etc.
Highest sum of contiguous subarray in an array
Use Kadane's algorithm to find the maximum sum subarray
Initialize max_so_far and max_ending_here to 0
Loop through the array and update max_ending_here and max_so_far
Return max_so_far as the highest subset sum subarray
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Legal Associate
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Artificial Intelligence Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Apac Customer Success Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
LegalDesk.com
Vakilsearch
QuickCompany
Myadvo