Complete Interview Preparation

View Details

Skip to content

- Tutorials
- Practice DS & Algo.
- Algorithms
- Analysis of Algorithms
- Asymptotic Analysis
- Worst, Average and Best Cases
- Asymptotic Notations
- Little o and little omega notations
- Lower and Upper Bound Theory
- Analysis of Loops
- Solving Recurrences
- Amortized Analysis
- What does 'Space Complexity' mean ?
- Pseudo-polynomial Algorithms
- Polynomial Time Approximation Scheme
- A Time Complexity Question

- Searching Algorithms
- Sorting Algorithms
- Graph Algorithms
- Pattern Searching
- Geometric Algorithms
- Mathematical
- Bitwise Algorithms
- Randomized Algorithms
- Greedy Algorithms
- Dynamic Programming
- Divide and Conquer
- Backtracking
- Branch and Bound
- All Algorithms

- Analysis of Algorithms
- Data Structures
- Interview Corner
- Languages
- CS Subjects
- GATE
- Web Technologies
- Software Designs
- School Learning
- School Programming
- Mathematics
- Maths Notes (Class 8-12)
- NCERT Solutions
- RD Sharma Solutions
- Physics Notes (Class 8-11)

- ISRO CS
- UGC NET CS

- Student
- Jobs
- Courses

- Arrays in Java
- Write a program to reverse an array or string
- Largest Sum Contiguous Subarray
- Program for array rotation
- Arrays in C/C++
- Stack Data Structure (Introduction and Program)
- Given an array A[] and a number x, check for pair in A[] with sum as x (aka Two Sum)
- Linear Search
- Maximum and minimum of an array using minimum number of comparisons
- K'th Smallest/Largest Element in Unsorted Array | Set 1
- Subset Sum Problem | DP-25
- Multidimensional Arrays in Java
- Python | Using 2D arrays/lists the right way
- Write a program to reverse an array or string
- Array of Strings in C++ (5 Different Ways to Create)
- Find the Missing Number
- Count Inversions in an array | Set 1 (Using Merge Sort)
- Queue | Set 1 (Introduction and Array Implementation)
- Search an element in a sorted and rotated array
- Linked List vs Array
- Program to find largest element in an array
- Sort an array of 0s, 1s and 2s
- Print a given matrix in spiral form
- Merge two sorted arrays
- Stock Buy Sell to Maximize Profit
- k largest(or smallest) elements in an array
- Find Second largest element in an array
- Sliding Window Maximum (Maximum of all subarrays of size k)
- Find subarray with given sum | Set 1 (Nonnegative Numbers)
- Given an array of size n and a number k, find all elements that appear more than n/k times

Improve Article

Save Article

Like Article

Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.