i
Pharmarack Technologies
Filter interviews by
Clear (1)
I applied via Referral and was interviewed before Mar 2022. There were 2 interview rounds.
Top trending discussions
I applied via LinkedIn
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
I applied via Walk-in and was interviewed in Jan 2022. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Jan 2022. There was 1 interview round.
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
I applied via Referral
I applied via Approached by Company and was interviewed before Sep 2022. There were 3 interview rounds.
Queue can be implemented using two stacks by maintaining the order of elements in the stacks.
Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the
Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.
Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...
Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.
Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle
Given three sorted arrays, find common elements.
Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array
Check if a number is a power of 2 or not.
A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Business Development Executive
112
salaries
| ₹2.2 L/yr - ₹5.3 L/yr |
Marketing Executive
101
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Regional Sales Manager
61
salaries
| ₹6.9 L/yr - ₹14.2 L/yr |
Technical Support Engineer
60
salaries
| ₹2.6 L/yr - ₹4.3 L/yr |
Technical Support Executive
38
salaries
| ₹2.2 L/yr - ₹4.1 L/yr |
Netmeds.com
Tata 1mg
PharmEasy
Medlife