Loading

Log In

Tutorials Exercises MCQs Interview Q & A Tests

HTML CSS JavaScript Java SQL Angular Spring

HTML CSS JavaScript Java SQL Angular Spring

Welcome to Quipoin

Login to track your progress

Quipoin Menu

Learn • Practice • Grow

Tutorial Exercises MCQs Interview Q & A Tests

Java Kickstart

Why Java for DSA?

Setup JDK and IDE

Variables and Data Types

Operators and Expressions

Strings in Java

Functions and Methods

Wrapper Classes and Autoboxing

Algorithm

What is an Algorithm?

Why Analysis of Algorithms?

Time Complexity

Space Complexity

Best, Average, Worst Case

Recursion Introduction

Recursion vs Iteration

Backtracking Basics

Array Foundation

Array Introduction

Array Operations

Multi-Dimensional Arrays

Prefix Sum Technique

Sliding Window Basics

Two Pointer Technique

Array Advanced

Kadane Algorithm

Moore Voting Algorithm

Dutch National Flag

Subarray Sum Problems

Matrix Problems

Strings

String Introduction

String Manipulation

StringBuilder vs StringBuffer

Pattern Matching Basics

Anagram and Palindrome

Sliding Window on Strings

LinkedList

Linked List Introduction

Singly Linked List

Doubly Linked List

Circular Linked List

Linked List Operations

Linked List Problems

Floyd Cycle Detection

Merge Sort on Linked List

Clone Linked List with Random

Stack

Stack Introduction

Stack Using Array

Stack Using Linked List

Stack Applications

Next Greater Element

Balanced Parentheses

Infix Postfix Prefix

Queue

Queue Introduction

Queue Using Array

Queue Using Linked List

Deque Introduction

Priority Queue Basics

Hashing

Hashing Introduction

HashMap in Java

HashSet in Java

Collision Handling

Frequency Counting

Two Sum Problems

Subarray Sum with HashMap

Trees

Tree Introduction

Tree Traversals

Level Order Traversal

Binary Search Tree

AVL Tree Introduction

Lowest Common Ancestor

Serialize and Deserialize Tree

Heap

Heap Introduction

Min Heap and Max Heap

Heapify Algorithm

PriorityQueue in Java

Kth Largest Element

Merge K Sorted Lists

Graph

Graph Introduction

Graph Representations

Cycle Detection

Topological Sort

Shortest Path Algorithms

Minimum Spanning Tree

Strongly Connected Components

Sorting

Sorting Introduction

Comparison of Sorting

Searching

Binary Search on Answer

Search in Rotated Array

Dynamic Programming

DP Introduction

Memoization vs Tabulation

Knapsack Problems

Longest Common Subsequence

Longest Increasing Subsequence

Matrix Chain Multiplication

Greedy Algorithms

Greedy Introduction

Activity Selection

Fractional Knapsack

Divide & Conquer

Divide and Conquer Intro

Binary Search DC

Strassen Matrix

Closest Pair Problem

Trie

Trie Introduction

Trie Operations

Auto-Complete System

Word Search in Trie

Segment Tree

Segment Tree Intro

Building Segment Tree

Lazy Propagation

Fenwick Tree

Fenwick Tree Intro

Building Fenwick Tree

Prefix Sum Queries

Fenwick vs Segment Tree

Bit Manipulation

Bitwise Operators

Subset Generation

Interview Bootcamp

Top 50 Array Problems

Top 50 String Problems

Top 50 Linked List Problems

Top 50 Tree Problems

Top 50 Graph Problems

Top 50 DP Problems

Mock Interviews

data-structure-with-java / data-structure-with-java - tutorial

tutorial

Videos Discussion

traversing

Need more clarification?

Drop us an email at career@quipoinfotech.com

Related Tutorials

JavaScript CSS Angular HTML

Ad

Premium Courses

Get unlimited access to all tutorials

Quipoin

Empowering developers through structured learning paths, hands-on exercises, and community discussions.

QuipoInfotech
Near New Sadar Hospital, Jhonsagadi
Deoghar, Jharkhand - 814112

career@quipoinfotech.com

Quick Links

Home
About Us
Contact Us
Privacy Policy

Learning Resources

Tutorials
Coding Exercises
Practice MCQs
Interview Questions
Test Series

Community

MindXchange Forum

Connect With Us

Copyright Quipo Infotech 2026. All Rights Reserved

Designed & Developed with by Quipo Infotech Private Limited