Preview 6 weeks - Problem Solving using Java

Problem Solving Techniques

Internship Overview

How to get placed at Accenture or Capgemini and many more MNC companies ?

Introduction to Data Structures

Data Structures - Introduction

Abstract Data Types

Abstract data types

Our Alumnus

Introduction to Big - O

Big-O Introduction

Dynamic & Static Arrays

Dynamic and Static Arrays

Dynamic Array - Source Code

Dynamic Array

Our Alumnus

Assessment - 1

Introduction to Linked Lists

Linked Lists - Introduction

Doubly Linked List - Source Code

Doubly Linked List

Assessment - 2

Introduction to Stack

Stack - Introduction

Implementation of Stack

Stack - Implementation

Stack - Source Code

Stack

Stack Interface

List Stack

Integer Stack

Array Stack

Our Alumnus

Assessment - 3

Introduction to Queue

Queue - Introduction

Implementation of Queue

Queue - Implementation

Queue - Source Code

Queue

Linked Queue

Integer Queue

Array Queue

Assessment - 4

Introduction to Priority Queue

Priority Queue - Introduction

Priority Queue Minimum Heaps & Maximum Heaps

Priority Queue - Minimum Heaps and Maximum Heaps

Priority Queue - Inserting Elements to Binary Heap

Adding Elements to Binary Heap

Priority Queue - Removing Elements from Binary Heap

Removing Elements from Binary Heap

Priority - Source Code

Priority Queue

Minimum Indexed Heap

Minimum Indexed Binary Heap

Minimum Heap

Binary Heap Quick Removals

Binary Heap

Our Alumnus

Assessment - 5

Introduction to Union Find

Union Find - Introduction

Union Find - Kruskal's Algorithm

Union Find - Union & Find Operations

Union Find - Union and Find Operations

Union Find - Path Compression

Union Find - Source Code

Union Find

Assessment - 6

Introduction to Binary Search Tree ( BST )

Binary Search Tree ( BST ) - Introduction

BST - Insertion

BST - Removal

BST - Traversals

BST - Source Code

Binary Search Tree ( BST )

Binary Search Tree

Splay Tree

Tree Traversal Order

Our Alumnus

Assessment - 7

Hash Tables Hash Functions

Hash Tables Hash Function

Hash Table Separate Chaining

Hash Table Separate Chaining - Source Code

Hash Table Separate Chaining

Hash Table - Open Addressing

Hash Table - Linear Probing

Linear Probing - Source Code

Hash Table - Quadratic Probing

Quadratic Probing - Source Code

Hash Table - Double Hasing

Hash Table - Double Hashing

Double Hashing - Source Code

Double Hashing Test Object

Hash Table - Open Addressing Removal

Hash Table - Open Addressing Removals

Hash Table - Open Addressing Source Code

Hash Table - Open Addressing

Hash Table Open Addressing Base

Secondary Hash

Our Alumnus

Assessment - 8

Fenwick Tree - Range Queries

Fenwick Tree - Point Updates

Fenwick Tree - Construction

Fenwick Tree - Source Code

Fenwick Tree

Range Query Point Update

Range Update Point Query

Assessment - 9

Introduction to Suffix Array

Suffix Array - Introduction

Longest Common Prefix ( LCP ) Array

Suffix Array Finding Unique Substrings

Longest Common Substring ( LCS ) Problem Suffix Array - Part 1

Longest Common Substring ( LCS ) Problem Suffix Array Part - 1

Longest Common Substring ( LCS ) Problem Suffix Array - Part 2

Longest Common Substring ( LCS ) Problem Suffix Array Part - 2

Longest Repeated Substring ( LRS ) Suffix Array

Suffix Array - Source Code

Suffix Array

Suffix Array - Fast

Suffix Array - Medium

Suffix Array - Slow

Our Alumnus

Assessment - 10

Balanced Binary Search Tree ( BST ) Rotation

Balanced BST - Rotation

AVL Tree - Insertion

AVL Tree - Removal

AVL Tree - Source Code

AVL Tree

AVL Tree Recursive

Red Black Tree

Treap Tree

Assessment - 11

Final steps to earn your "Detailed Performance Evaluation" report

Preview - 6 weeks - Problem Solving using Java