## [24]7 Innovation Labs Interview Experience (6 Months Experience)

Round 1:(Hackerrank Test) Q1: Binary tree mirror image check ( https://www.geeksforgeeks.org/check-if-two-trees-are-mirror/ ) Q2: Stack reversal in place // just the function ( https://www.geeksforgeeks.org/reverse-a-stack-using-recursion/) Q3: Kendanes… Read More »

## Union and Intersection of two linked lists | Set-3 (Hashing)

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »

## Union and Intersection of two linked lists | Set-2 (Using Merge Sort)

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »

## [24]7 Innovation Labs Interview Experience | Set 4 (Off-Campus)

Round 1(Telephonic) Explained about company JD Snake and Ladder game (matrix, array, linked list) Find the row with maximum 1s where every row of sorted… Read More »

## [24]7 Innovation Labs Interview Experience | Set 3 (On-Campus)

Round 1 : (Duration:1 hr) Written test consisting of MCQs in aptitude, data structures and analytical thinking. 3 coding questions were also asked of us,… Read More »

## [24]7 Innovation Labs Interview Experience | Set 2

Telephonic Discussion: 1) Basic Java Questions about Strings. 2) Sorting linked list of 0 and 1 and make separate linked list for both (further modified… Read More »

## [24]7 Innovation Labs Interview Experience

I had an interview with 24*7 innovation labs. Their process is telephonic followed by 3 f2f interviews. Round-1 Telephonic 1) Stack reversal in place 2)… Read More »

## HeapSort

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the… Read More »

Given a linked list where every node represents a linked list and contains two pointers of its type: (i) Pointer to next node in the… Read More »

## Find the row with maximum number of 1s

Given a boolean 2D array, where each row is sorted. Find the row with the maximum number of 1s. Example: Input matrix 0 1 1… Read More »

## Implement two stacks in an array

Create a data structure twoStacks that represents two stacks. Implementation of twoStacks should use only one array, i.e., both stacks should use the same array… Read More »

## Union and Intersection of two Linked Lists

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elments… Read More »

## Largest Sum Contiguous Subarray

Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum. Recommended: Please solve… Read More »