Print binary representation of a number – C, C++, Java, and Python
Print binary representation of a given number in C, C++, Java, and Python using built-in methods and custom routines.
Category: Java
Linked List Implementation in Java
The LinkedList class in Java is a doubly-linked list implementation of the List interface. This post provides an overview of common techniques to implement a linked list in Java programming language.
Traverse a given directory using BFS and DFS in Java
This post will discuss how to traverse the given directory and list out all files present in it and all its sub-directories using BFS and DFS.
Implementation of KMP Algorithm – C, C++, Java, and Python
The KMP Algorithm (or Knuth, Morris, and Pratt string searching algorithm) cleverly uses the previous comparison data. It can search for a pattern in linear time as it never re-compares a text symbol that has matched a pattern symbol.
Iterative approach to finding permutations of a string
This post will discuss how to find permutations of a string using iteration. The implementation should be able to handle strings with duplicate characters and don’t repeat the permutations.
Number to word conversion
Write an efficient program to convert a given number to words.
Min Heap and Max Heap Implementation in Java
In previous post, we have introduced the heap data structure and covered heapify-up, push, heapify-down and pop operations. This article covers Java implementation of Priority Queue Data Structure (Max Heap and Min heap).
Stack Implementation in Java
A stack is a linear data structure that follows the LIFO (Last–In, First–Out) principle. That means the objects can be inserted or removed only at one end of it, also called a top.
Queue Implementation in Java
This article covers queue implementation in Java. A queue is a linear data structure which follows the FIFO (first-in first-out) principle. That means the object which is inserted first will be the first one out, followed by the object which was inserted next.
Heap Sort Algorithm – Overview & C, C++, Java, and Python Implementation
Heapsort is an in-place, comparison-based sorting algorithm and can be thought of as an improved selection sort as it divides the input into a sorted and an unsorted region.
Graph Implementation in Java using Collections
In this post, we will see graph implementation in Java using Collections for weighted and unweighted, graph and digraph.
Binary Search in C++ STL and Java Collections
This post will discuss how to search for a given target value in a sorted array of integers using binary search implementation provided by the C++ standard library (STL) and Java Collection framework.