Skip to content

Tag Archives: OATS Systems

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space).Examples: Input: head1: 5->7->9 head2: 4->6->8 Output: 4->5->6->7->8->9… Read More
Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space). Examples:  Input : head1: 5->7->9 head2: 4->6->8… Read More
There were three rounds. Round 1. It was a written round, questions were from algorithms and DBMS 1) Find two rectangles overlap 2)Find the k-th… Read More
Given two rectangles, find if the given two rectangles overlap or not.Note that a rectangle can be represented by two coordinates, top left and bottom… Read More
Given two sorted linked lists consisting of N and M nodes respectively. The task is to merge both of the lists (in place) and return the… Read More
Given a string S consisting of lowercase Latin Letters, the task is to find the first non-repeating character in S. Examples:  Input: “geeksforgeeks”Output: fExplanation: As… Read More

Start Your Coding Journey Now!