Health City Trauma Center & Superspeciality Hospital Interview Questions and Answers

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 ...read more

Retrieve the 2nd highest and nth highest marks from a student table using SQL queries.

• Use the DISTINCT keyword to avoid duplicate marks.

• For the 2nd highest marks: SELECT DISTINCT Marks FROM student ORDER BY Marks DESC LIMIT 1 OFFSET 1;

• For nth highest marks: SELECT DISTINCT Marks FROM student ORDER BY Marks DESC LIMIT 1 OFFSET n-1; (replace n with the desired number)

• Example for 2nd highest: If Marks are 90, 85, 90, 80, ...read more

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...read more

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 ...read more

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.

I haven't contributed to open source due to time constraints and focusing on personal projects and learning new technologies.

• Time Constraints: Balancing work, personal projects, and learning new technologies has limited my availability.

• Focus on Personal Projects: I've been dedicated to developing my own applications, such as a task management tool.

• Learning New Technologies: I prioritized mastering frameworks like React...read more

Event bubbling is the propagation of an event from the innermost child element to the outermost parent element.

• Events triggered on a child element will also trigger on its parent elements

• The event travels up the DOM tree until it reaches the document object

• Can be stopped using event.stopPropagation()

• Can be useful for event delegation

The .on('click',function() is a more flexible method than .click(function())

• The .on() method can handle multiple events and selectors

• The .click() method can only handle one event and one selector

• The .on() method can also handle dynamically added elements

• The .click() method cannot handle dynamically added elements

Function to check if two strings are anagram or not

• Create two character arrays from the strings

• Sort the arrays

• Compare the sorted arrays

Function to determine the order of integers in an array.

• Check first and last element to determine if increasing or decreasing

• Check for inflection point to determine if order changes

• Return order type as string

Optimize images, minify code, reduce HTTP requests, use caching, and lazy loading.

• Optimize images using compression and appropriate file formats

• Minify code to reduce file size and improve load times

• Reduce HTTP requests by combining files and using sprites

• Use caching to store frequently accessed data locally

• Implement lazy loading to defer loading of non-critical resources

Design a database schema for a movie site with user ratings and recommendations.

• Create tables for movies, users, ratings, and recommendations

• Use foreign keys to link tables

• Include columns for movie genre and user watch history

• Algorithm for recommendations can use user watch history and ratings to suggest similar movies

Using a coin toss function, we can generate random binary outcomes for various applications in programming.

• The toss() function simulates a fair coin toss, returning 'head' or 'tail'.

• It can be used in games to make random decisions, like choosing a player to start.

• In algorithms, it can help in randomized algorithms, such as quicksort.

• Example: If toss() returns 'head', you might proceed with one branch of logic; if 'tail...read more

Function to simulate dice roll with equal probability without using random function

• Use a toss function that returns either 0 or 1 with equal probability

• Call the toss function 3 times and convert the result to a binary number

• If the binary number is greater than 0 and less than or equal to 6, return it

• If the binary number is greater than 6, repeat the process

Query to fetch duplicate email from table

• Use GROUP BY and HAVING clause to filter out duplicates

• SELECT email, COUNT(*) FROM table_name GROUP BY email HAVING COUNT(*) > 1;

• This will return all the duplicate emails in the table

Precompilation unit is a compiled code that can be reused by multiple source files.

• Precompilation unit is created by the compiler from the source code.

• It contains the compiled code of header files and other dependencies.

• It can be reused by multiple source files, reducing compilation time.

• It is also known as precompiled header or PCH.

• Example: stdafx.h in Visual Studio is a precompiled header file.

The first 50 prime numbers are...

• Start with 2, the first prime number

• Check each odd number greater than 2

• Use trial division to check if a number is prime

• Stop when you have found 50 prime numbers

I am a passionate software engineer with experience in developing web applications using various technologies.

• Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

• Proficient in backend development with Node.js, Express, and MongoDB

• Familiar with version control systems like Git and project management tools like Jira