Publish Your Article Here

Program: Write a program to get a line with max word count from the given file.


Below example shows how to find out the line with maximum number of word count in the given file. In case if it has multiple lines with max number of words, then it has to list all those lines.

package com.java2novice.algos;

import java.util.ArrayList;
import java.util.List;

public class MaxWordCountInLine {

        private int currentMaxCount = 0;
        private List<String> lines = new ArrayList<String>();
        public void readMaxLineCount(String fileName){

                FileInputStream fis = null;
                DataInputStream dis = null;
                BufferedReader br = null;
                try {
                        fis = new FileInputStream(fileName);
                        dis = new DataInputStream(fis);
                        br = new BufferedReader(new InputStreamReader(dis));
                        String line = null;
                        while((line = br.readLine()) != null){
                                int count = (line.split("\\s+")).length;
                                if(count > currentMaxCount){
                                        currentMaxCount = count;
                                } else if(count == currentMaxCount){
                } catch (FileNotFoundException e) {
                } catch (IOException e) {
                } finally{
                                if(br != null) br.close();
                        }catch(Exception ex){}

        public int getCurrentMaxCount() {
                return currentMaxCount;

        public void setCurrentMaxCount(int currentMaxCount) {
                this.currentMaxCount = currentMaxCount;

        public List<String> getLines() {
                return lines;

        public void setLines(List<String> lines) {
                this.lines = lines;
        public static void main(String a[]){
                MaxWordCountInLine mdc = new MaxWordCountInLine();
                System.out.println("Max number of words in a line is: "+mdc.getCurrentMaxCount());
                System.out.println("Line with max word count:");
                List<String> lines = mdc.getLines();
                for(String l:lines){

true, false, and null might seem like keywords, but they are actually literals.
You cannot use them as identifiers in your programs. The servlet context
is an interface which helps to communicate with other servlets. It contains
information about the Web application and container. It is kind of
application environment. Using the context, a servlet can obtain URL
references to resources, and store attributes that other servlets in the
context can use.

Max number of words in a line is: 13
Line with max word count:
true, false, and null might seem like keywords, but they are actually literals. 
<< Previous Program | Next Program >>

List Of All Interview Programs:

  1. Remove last node of the Linked List
  2. Identify middle element of a Linked List
  3. Identify given LinkedList is a palindrom or not using Stack.
  4. Remove duplicates from sorted linked list
  5. Find Nth node from the end of Linked List
  6. Identify loop/cycle in a LinkedList.
  7. Find length of a loop in a LinkedList.
  8. Detect and remove loop in a LinkedList.
  9. How to reverse Singly Linked List?
  10. Check if given Linked List is a Circular Linked List or not.
  11. Find out duplicate number between 1 to N numbers.
  12. Find out middle index where sum of both ends are equal.
  13. Write a singleton class.
  14. Write a program to create deadlock between two threads.
  15. Write a program to reverse a string using recursive algorithm.
  16. Write a program to reverse a number.
  17. Write a program to convert decimal number to binary format.
  18. Write a program to find perfect number or not.
  19. Write a program to implement ArrayList.
  20. Write a program to find maximum repeated words from a file.
  21. Wrie a program to find out duplicate characters in a string.
  22. Write a program to find top two maximum numbers in a array.
  23. Write a program to sort a map by value.
  24. Write a program to find common elements between two arrays.
  25. How to swap two numbers without using temporary variable?
  26. Write a program to print fibonacci series.
  27. Write a program to find sum of each digit in the given number using recursion.
  28. Write a program to check the given number is a prime number or not?
  29. Write a program to find the given number is Armstrong number or not?
  30. Write a program to convert binary to decimal number.
  31. Write a program to check the given number is binary number or not?
  32. Write a program for Bubble Sort in java.
  33. Write a program for Insertion Sort in java.
  34. Write a program to implement hashcode and equals.
  35. How to get distinct elements from an array by avoiding duplicate elements?
  36. Write a program to get distinct word list from the given file.
  37. Write a program to get a line with max word count from the given file.
  38. Write a program to convert string to number without using Integer.parseInt() method.
  39. Write a program to find two lines with max characters in descending order.
  40. Write a program to find the sum of the first 1000 prime numbers.
  41. Find longest substring without repeating characters.
  42. Write a program to remove duplicates from sorted array.
  43. How to sort a Stack using a temporary Stack?
  44. Write a program to print all permutations of a given string.
  45. Implement Binary Search Tree (BST)
  46. Find min and max value from Binary Search Tree (BST)
  47. Find height of a Binary Search Tree (BST)
  48. Implement Binary Search Tree (BST) Level order traversal (breadth first).
  49. Implement Binary Search Tree (BST) pre-order traversal (depth first).
  50. Implement Binary Search Tree (BST) in-order traversal (depth first).
  51. Implement Binary Search Tree (BST) post-order traversal (depth first).
  52. How to check the given Binary Tree is Binary Search Tree (BST) or not?
  53. How to delete a node from Binary Search Tree (BST)?
  54. Write a program to find common integers between two sorted arrays.
  55. Write a program to find given two trees are mirror or not.
  56. HackerRank stack problem - Find maximum element.
  57. HackerRank stack problem - Balanced Brackets.
  58. HackerRank stack problem - Equal Stacks.
  59. HackerRank stack problem - Game Of Two Stacks.
Knowledge Centre
Where can we use serialization?
Whenever an object has to sent over the network, those objects should be serialized. Also if the state of an object is to be saved, objects need to be serilazed.
Famous Quotations
If you don’t make mistakes, you’re not working on hard enough problems. And that’s a big mistake.
-- Frank Wilczek

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2024 by Nataraja Gootooru. All Rights Reserved.