Description
Everything you need to know to get the job. Contribute to kdn251/interviews development by creating an account on GitHub.
Summary
- Online Judges Live Coding Practice Data Structures Linked List A Linked List is a linear collection of data elements, called nodes, each pointing to the next node by means of a pointer.
- a binary tree in which every level except possibly the last is full and all nodes in the last level are as far left as possible Binary Search Tree A binary search tree, sometimes called BST, is a type of binary tree which maintains the property that the value in each node must be greater than or equal to any value stored in the left sub-tree, and less than or equal to any value stored in the right sub-tree Time Complexity: O(log(n)) Hashing Hashing is used to map data of an arbitrary size to data of a fixed size.
- Θ(n + k) Radix Sort Radix Sort is a sorting algorithm that like bucket sort, distributes elements of an array into a number of buckets.