Javascript Program For Finding The Middle Element Of A Given Linked List
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then the output should be 4....
read more
Javascript Program For Merge Sort Of Linked Lists
Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible....
read more
Find Middle of the Linked List
Given a Singly Linked List, the task is to find the middle of the linked list. If the number of nodes are even, then there would be two middle nodes, so return the second middle node....
read more
Veritas Interview Experience (On-Campus)
Veritas visited our capus  on 5th Aug 2020 (Considering COVID situation whole interview process was virtual using WEBEX platform). For those who dont know veritas,It is a product based company which provides enterprise storage solutions to almost all fortune 500 companies. There main domains are storages and operating systems. The interview process can be rated as moderate based on difficulty. The interview consisted of total 4 rounds....
read more
Java Program For Finding The Middle Element Of A Given Linked List
Given a Singly linked list, find the middle of the linked list. If there are even nodes, then there would be two middle nodes, we need to print the second middle element....
read more
Python Program For Finding The Middle Element Of A Given Linked List
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then the output should be 4....
read more
Insertion Sort – Data Structure and Algorithm Tutorials
Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is a stable sorting algorithm, meaning that elements with equal values maintain their relative order in the sorted output....
read more
Veritas Technologies Interview Experience | On-Campus 2022
Veritas visited our college for campus hiring for two roles: FTE + 6 months Internship. Only 6 months Internship....
read more
Veritas Interview Experience | On-Campus
Round 1(Online Test):...
read more
C++ Program For Finding The Middle Element Of A Given Linked List
Given a singly linked list, find the middle of the linked list....
read more
C Program For Finding The Middle Element Of A Given Linked List
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1->2->3->4->5->6 then the output should be 4....
read more
Veritas Interview Experience (On Campus)
Veritas visited our college for hiring. There was 1 apti round,1technical,1 managerial round and lastly HR round....
read more