i
Pharmarack Technologies
Filter interviews by
I applied via Company Website and was interviewed in Aug 2023. There were 2 interview rounds.
I know Pharmarack very well, I worked a lot of time in Pharmarack, I solved a lot of problems, my experience in Pharmarack is very good.
I have 1 year experience Pharmarack company.
BBA , MBA , and Other MSCIT and Tally.
Top trending discussions
posted on 3 Aug 2021
I applied via LinkedIn and was interviewed in Jul 2021. There was 1 interview round.
posted on 24 Jan 2025
I appeared for an interview in Jul 2024.
I applied via Naukri.com and was interviewed before Aug 2022. There were 3 interview rounds.
I applied via LinkedIn and was interviewed in Feb 2021. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2021. There were 4 interview rounds.
90 minute test on hacker rank consisting of 3 coding questions all of medium difficulty. Most candidates are required to solve more than 1 question.
Find the lowest common ancestor of a binary tree.
Traverse the tree recursively from the root node.
If the current node is null or matches either of the given nodes, return the current node.
Recursively search for the nodes in the left and right subtrees.
If both nodes are found in different subtrees, return the current node.
If both nodes are found in the same subtree, continue the search in that subtree.
Find first missing positive integer from an array of non-negative integers.
Create a hash set to store all positive integers in the array
Loop through the array and add all positive integers to the hash set
Loop through positive integers starting from 1 and return the first missing integer not in the hash set
Design a parking lot
Consider the size and capacity of the parking lot
Decide on the layout and organization of parking spaces
Implement a system to manage parking availability and reservations
Include features like ticketing, payment, and security
Consider scalability and future expansion
Group list of strings into distinct anagrams.
Create a hash table with sorted string as key and list of anagrams as value.
Iterate through the list of strings and add each string to its corresponding anagram list in the hash table.
Return the values of the hash table as a list of lists.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA were discussed.
Ninja is tasked with merging two given sorted integer arrays ARR1
and ARR2
of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...
Merge two sorted arrays into one sorted array within the first array.
Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.
Compare elements from both arrays and place the larger element at the end of ARR1.
Continue this process until all elements are merged in sorted order within ARR1.
Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...
Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.
Traverse the tree in level order and store nodes at even levels in a separate list.
Reverse the list of nodes at even levels.
Update the tree with the reversed nodes at even levels.
Repeat the process for alternate levels starting from level 2.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on OS, Java were discussed.
Characteristics of distributed file systems include scalability, fault tolerance, and data replication.
Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.
Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.
Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...
Design a file sharing mechanism between two users.
Implement a secure login system for both users.
Allow users to upload files to a shared server.
Provide a way for users to view and download files shared by the other user.
Implement access control to ensure only authorized users can access the shared files.
ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.
ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.
It achieves thread-safety by dividing the map into segments, each of which can be locked independently.
ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.
Example:...
Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.
Collect and store user interaction data such as clicks, page views, and time spent on each feature.
Use analytics tools to generate reports and visualize usage patterns.
Identify popular features, user preferences, and areas for improvement based on usage data.
Implement A/B testing to compare different ver...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round with questions based on DSA.
Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.
T
For each test cas...
Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.
Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.
Use recursion to traverse the binary tree efficiently.
Handle null nodes represented by -1 in the input.
Follow the order of nodes as they appear in the level order traversal.
Ensure the output is space-separated lists for each traversal type.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Use a combination of hashmap and doubly linked list to implement the LRU cache.
Keep track of the least recently used item and update it accordingly.
Ensure to handle cache capacity by evicting the least recently used item when the cache is full.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA, OS etc.
You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....
The task is to determine the number of islands present on a 2D grid after each query of converting water to land.
Create a function that takes the grid dimensions, queries, and coordinates as input.
For each query, convert the water at the given coordinates to land and update the grid.
Use depth-first search (DFS) to find connected lands and count the number of islands.
Return the number of islands after each query.
Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.
Prevents multiple threads from accessing critical sections of code simultaneously
Ensures data consistency and prevents race conditions
Improves performance by reducing contention for shared resources
Example: synchronized block in a method that updates a shared variable
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Business Development Executive
110
salaries
| ₹2.2 L/yr - ₹5.5 L/yr |
Marketing Executive
97
salaries
| ₹2 L/yr - ₹4.2 L/yr |
Technical Support Engineer
60
salaries
| ₹2.6 L/yr - ₹4.3 L/yr |
Regional Sales Manager
57
salaries
| ₹6.9 L/yr - ₹14.2 L/yr |
Technical Support Executive
38
salaries
| ₹2.2 L/yr - ₹4.1 L/yr |
CMS IT Services
Quantiphi Analytics Solutions Private Limited
PrimEra Medical Technologies
Mavenir Systems