Learn to code

Nlogn is a platform to learn to code and prepare for product-based companies interview for free

Explore Topics

Choose from wide variety of available topics admired by 1000+ amazing learners.

Data Structure

Learn most popular data structures and their implementation

Start Learning

System Design

Learn how to design system architecture that can scale million of users

Start Learning

High Performance Computing

Learn how to aggregate computing power to deliver higher performance

Start Learning

Subscribe to our occasional newsletter

Join our community of 1000+ amazing learners and stay updated with our latest tech blogs and guide on how to ace coding interveiws.

We promise, we won't spam
Even we hate spam as much as you hate them

Practice Coding Interview Problems

Try some of the most popular interview questions

Coin Change: Find number of ways of representing n cents

Dynamic Programming

Solve Now

Designing a scalable URL Shortener like Tiny URL

System Design - Nlogn

See solution

Reverse a linked list in Linear Time without using extra space

Linked List

Solve Now

Insert, Search and Delete Operation in Binary Search Tree

Tree Data Structure

Learn More

Latest blog post at Nlogn

System Design Tutorial

System Design Guide To Ace Your Next System Design Interview

"System Design" or "System Architecture" is a very popular term when it comes to job interviews at Big tech companies like Facebook, Google,...
Nlogn Team - 0
Read More
Data Structures

Distance, Diameter, Eccentricity, Radius and Center of a Graph

A graph is defined as a set of Vertices and lines joining these vertices known as Edges.  Today we will learn about various...
Nlogn Team - 0
Read More
Machine Learning

Introduction to Gradient Descent for Machine Learning

Gradient Descent is an optimization algorithm commonly used in machine learning to optimize a Cost Function or Error Function by updating the parameters...
Nlogn Team - 0
Read More
Data Structures

HeapSort Algorithm Tutorial and Implementation

HeapSort is an efficient (O(N*lognN) time) comparison-based sorting algorithm based on Binary Heaps. It works by dividing input unsorted array into the sorted...
Nlogn Team - 1
Read More
Data Structures

Build Heap and Heapify Operation [Tutorial]

Build Heap is a process of building a Heap from a given element generally in an array format. The resulting heap will be...
Nlogn Team - 0
Read More
Data Structures

Binary Heap Data Structure [Introduction]

A Binary Heap is a form of Binary Tree with the following additional properties - A Binary Heap is a complete Binary tree...
Nlogn Team - 0
Read More
© nlogn.in 2020