GeeksforGeeks NSIT

Thanks to the following people for contributing in the Technical Scripter event!
People with the following user logins, please collect your token gifts sent by GeeksforGeeks Team from me. Congrats!
You can contact me on +91-9971001030

One of the most popular interview questions on BST!
https://practice.geeksforgeeks.org/problems/fixed-two-nodes-of-a-bst/1

https://practice.geeksforgeeks.org/courses/geeks-classes-algorithms

After successfully hosting 4 batches of Data Structures & Algorithms, we present a new crash course on Algorithms mentored by Mr. Sandeep Jain(Founder GeeksforGeeks)

The course is focused on practicing advance problems in the class itself

Recommended for :

Final year students preparing for the Placement drives
Working professionals looking for a job change.

Course starting from 27th October
Course Duration - 8 Lectures(Saturday & Sunday)
Course Fees: Rs 6000/-

Register now: https://practice.geeksforgeeks.org/courses/geeks-classes-algorithms

Queries to add, remove and return the difference of maximum and minimum. - GeeksforGeeks Given Q queries. The queries are of three types and are described below: Add the number num to the list. Remove the number num from… Read More »

Worried about starting your third semester at NSIT?GeeksforGeeks NSIT has got your back.
COE students.. start today with Design and Analysis of Algorithms. Here are all the links you need to go through for your Design and Analysis of Algorithms end semesters.

Stay tuned more stuff coming soon.

Strassen's matrix multiplication
https://www.geeksforgeeks.org/strassens-matrix-multiplication/

Principle of Optimality
https://www.geeksforgeeks.org/dynamic-programming-set-2-optimal-substructure-property/

Optimal binary SearchTrees
https://www.geeksforgeeks.org/dynamic-programming-set-24-optimal-binary-search-tree/

Solving the 0-1 Knapsack Problem
https://www.geeksforgeeks.org/knapsack-problem/

Branch and Bound
https://www.geeksforgeeks.org/branch-and-bound-set-1-introduction-with-01-knapsack/

Best, Average and Worst case complexity of various Sorting algorithms
https://www.geeksforgeeks.org/time-complexities-of-all-sorting-algorithms/

Interpolation Search
https://www.geeksforgeeks.org/interpolation-search/

NP-completeness
https://www.geeksforgeeks.org/np-completeness-set-1/

Dynamic Programming with binomial coefficient
https://www.geeksforgeeks.org/dynamic-programming-set-9-binomial-coefficient/

Implementation of 0/1 Knapsack
https://www.geeksforgeeks.org/branch-and-bound-set-2-implementation-of-01-knapsack/

N-Queen
https://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/

Travelling Salesman Problem
https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/

Shellshort
https://www.geeksforgeeks.org/shellsort/

Radix sort
https://www.geeksforgeeks.org/radix-sort/

External sort
https://www.geeksforgeeks.org/external-sorting/

Bellman Ford Algorithm
https://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/

Floyd's Algorithm
https://www.geeksforgeeks.org/dynamic-programming-set-16-floyd-warshall-algorithm/

Djikstra's Algorithm
https://www.geeksforgeeks.org/greedy-algorithms-set-6-dijkstras-shortest-path-algorithm/

Minimum Spanning trees
https://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-minimum-spanning-tree-mst-2/

Kruskal's Algorithm
https://www.geeksforgeeks.org/greedy-algorithms-set-2-kruskals-minimum-spanning-tree-mst/

Max-flow-min out
https://www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/

Stable marriage Problems
https://www.geeksforgeeks.org/stable-marriage-problem/

Hashing
https://www.geeksforgeeks.org/hashing-set-1-introduction/

Linear Programming
https://www.geeksforgeeks.org/linear-programming/

Hill Climbing
https://www.geeksforgeeks.org/introduction-hill-climbing-artificial-intelligence/

Genetics Algorithms
https://www.geeksforgeeks.org/genetic-algorithms/

Divide and Conquer | Set 5 (Strassen's Matrix Multiplication) - GeeksforGeeks Given two square matrices A and B of size n x n each, find their multiplication matrix. Naive Method Following is a simple way to… Read More »

https://www.geeksforgeeks.org/geeks-classes-gcet-5-on-1st-august/
Registration Link : https://practice.geeksforgeeks.org/contest/geeks-classes-entrance-test-5/
The C++ course is targeted for first/second year students. The course is mentored by Mr. Sandeep Jain (Founder & CEO, GeeksforGeeks). Since there are limited number of seats, we are conducting an online contest. Top performers of the contest shall get upto 100% discount.

Geeks Classes | GCET-5 on 1st August - GeeksforGeeks A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.