LogixHealth Software Developer Interview Questions and Answers

1 coding question, and basic MCQ

Q1. Maximal rectangal
Ans. 
Find the largest rectangle containing only 1s in a binary matrix.
• Use dynamic programming to track heights of consecutive 1s.

• For each row, treat it as a histogram and calculate the maximal rectangle.

• Utilize a stack to efficiently compute the largest rectangle in a histogram.

• Example: For a matrix [[0,1,1],[1,1,0],[1,1,1]], the largest rectangle has area 4.
Answered by AI
Add your answer
Q2. Loop in linked list
Ans. 
Loop in linked list is a situation where a node points to a previous node in the list, creating an infinite loop.
• Check for loops using Floyd's cycle detection algorithm

• Use two pointers, one moving twice as fast as the other, to detect a loop

• If the fast pointer catches up to the slow pointer, there is a loop
Answered by AI
Add your answer

Q1. Basic hr question regarding your project and all
Add your answer
Q2. He was more interested in what is my thinking pattern
Add your answer

Q1. Orientation skills
Add your answer
Q2. Tell me about yourself
Ans. 
I'm a passionate software engineer with a strong background in full-stack development and a love for problem-solving.
• Graduated with a degree in Computer Science from XYZ University.

• Worked at ABC Corp, where I developed a web application that improved user engagement by 30%.

• Proficient in languages like JavaScript, Python, and Java, with experience in frameworks such as React and Django.

• Enjoy collaborating in agile teams...read more
Answered by AI
Add your answer

It was an easy test. It consisted of MCQs and two coding qns. Prepare SQL well. It also had 2 programming question. Both were medium difficukty

Q1. It was mainly focussed on my projects. Be thorough with you resume. But it also depends on the interviewer.
Add your answer

Q1. DSA Next Greater element 2 Cycle in Linked List and if cycle remove it Best time to buy and sell stocks Coin Change
Ans. 
Key DSA problems: Next Greater Element, Cycle in Linked List, Stock Trading, and Coin Change.
• Next Greater Element: Find the next greater number for each element in an array. Example: For [4, 5, 2, 10], result is [5, 10, 10, -1].

• Cycle in Linked List: Detect and remove a cycle using Floyd's Tortoise and Hare algorithm. If a cycle exists, find the start and remove it.

• Best Time to Buy and Sell Stocks: Maximize profit by fi...read more
Answered by AI
Add your answer
Q2. Pyspark Optimisation techniques Wide and Narrow Transportmations Application Master
Add your answer
Q3. SQL Top 3 salaries per department Total working hours for an employee
Ans. 
Retrieve the top 3 salaries from each department and calculate total working hours for each employee using SQL queries.
• Use the ROW_NUMBER() function to rank salaries within each department: SELECT *, ROW_NUMBER() OVER (PARTITION BY department_id ORDER BY salary DESC) AS rank FROM employees.

• Filter the results to get only the top 3 salaries: WHERE rank <= 3.

• To calculate total working hours, use SUM() function: SELECT ...read more
Answered by AI
Add your answer

Q1. Valid parentheses
Ans. 
Valid parentheses check ensures every opening bracket has a corresponding closing bracket in the correct order.
• Use a stack to track opening parentheses. Example: '(()' -> push '(', push '(', pop ')' -> stack: ['(']

• For each closing parenthesis, check if the stack is not empty and matches the last opened. Example: '()' -> valid.

• An empty stack at the end indicates all parentheses were matched. Example: '(()())' -...read more
Answered by AI
Add your answer
Q2. Currying with arrow function
Ans. 
Currying is a technique in functional programming where a function with multiple arguments is transformed into a sequence of nested functions, each taking a single argument.
• Currying can be achieved using arrow functions in JavaScript.

• Arrow functions automatically bind 'this' and do not have their own 'this' value.

• Example: const add = a => b => a + b;

• Example: const addFive = add(5); const result = addFive(3); // result ...read more
Answered by AI
Add your answer

Q1. DFS related problem
Add your answer
Q2. Machine coding round
Add your answer