Scribd
Upload
34 views12 pages

Java Coding Problems and Solutions

The document outlines a comprehensive list of programming problems to be solved, focusing on various topics such as arrays, strings, binary search, and algorithms like sliding window. It includes links to specific problems on platforms like Hackerrank, LeetCode, and GeeksforGeeks. The goal is to solve 150 programs across these categories to enhance coding skills.

Uploaded by

neogneog008
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
34 views12 pages

Java Coding Problems and Solutions

The document outlines a comprehensive list of programming problems to be solved, focusing on various topics such as arrays, strings, binary search, and algorithms like sliding window. It includes links to specific problems on platforms like Hackerrank, LeetCode, and GeeksforGeeks. The goal is to solve 150 programs across these categories to enhance coding skills.

Uploaded by

neogneog008
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

Problem Solving

Programs on Array
Program on Strings
Problems on java collection framework objects like ArrayList , HashSet and HashMap
Searching and Sorting Techniques
Sliding window algorithm and its programs
Binary Search Algorithm and its Programs
Will Solve 150 programs on various Coding Platforms Like Hackerrank , LeetCode, Coding ninjas and GFG

List of Programs
Basic Programs
[Link]
[Link]
[Link]
[Link]
[Link]

Problems on Strings
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Problems on Array
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Problems Based on Binary Search


[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Problems on Collection
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link] Queue
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Sliding Window Algorithm


prog 1:
total number of substrings having unique characters
prog 2 :
longest substring having unique character
prog3 :
total number of substrings having atmost k unique character
prog 4:
longest substring having atmost k unique chracters
prog 5:
longest substring having exactly k unique charcaters
prog 6
total no of substrings having exactly k unique charcaters
prog 7:
total no of substring having at least k unique characters
prog 8:
longest substring having at least k unique charcaters

[Link]

[Link]
[Link]
[Link]
Stacks and Queue
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Linked List

[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Trees

[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Graph
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]

Dynamic Programming
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
[Link]
Backtracking

[Link]
[Link]
[Link]
[Link]

[Link]
g ninjas and GFG

&utm_medium=ml_article_practice_tab&utm_campaign=article_practice_tab
ection=true&leftPanelTabValue=PROBLEM

PanelTabValue=DISCUSS

2221410?leftPanelTabValue=SUBMISSION
rgeeks&utm_medium=ml_article_practice_tab&utm_campaign=article_practice_tab

rce=youtube&utm_medium=affiliate&utm_campaign=striver_Arrayproblems

rce=youtube&utm_medium=affiliate&utm_campaign=striver_Arrayproblems&leftPanelTabValue=SUBMISSION
geeks&itm_medium=article&itm_campaign=bottom_sticky_on_article

edium=affiliate&utm_campaign=striver_Arrayproblems&leftPanelTabValue=SUBMISSION

_medium=affiliate&utm_campaign=striver_Arrayproblems
=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article
=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article
eks&utm_medium=ml_article_practice_tab&utm_campaign=article_practice_tab
=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article
ers_2221410?leftPanelTabValue=SUBMISSION

ksforgeeks&utm_medium=article_practice_tab&utm_campaign=article_practice_tab

7115620/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article

_medium=ml_article_practice_tab&utm_campaign=article_practice_tab
urce=geeksforgeeks&utm_medium=article_practice_tab&utm_campaign=article_practice_tab
?utm_source=geeksforgeeks&utm_medium=article_practice_tab&utm_campaign=article_practice_tab

ay_839724?interviewProblemRedirection=true&leftPanelTabValue=SUBMISSION
ay_1082549
um=article&itm_campaign=practice_card

geeks&itm_medium=article&itm_campaign=practice_card

um=article&itm_campaign=practice_card
blem-list-v2&envId=binary-search&
y=School,Basic&status=unsolved&sortBy=submissions

eeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article
um=article&itm_campaign=practice_card
y=School,Basic&status=unsolved&sortBy=submissions

ection=true&leftPanelTabValue=PROBLEM\

&itm_medium=article&itm_campaign=bottom_sticky_on_article
8?leftPanelTabValue=PROBLEM

ource=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article
&sortBy=submissions

TabValue=PROBLEM

e3451/1?utm_source=geeksforgeeks&utm_medium=ml_article_practice_tab&utm_campaign=article_practice_tab
orgeeks&utm_medium=article_practice_tab&utm_campaign=article_practice_tab

m_medium=article_practice_tab&utm_campaign=article_practice_tab

=striver&utm_medium=website&utm_campaign=a_zcoursetuf
urce=striver&utm_medium=website
39?utm_source=striver&utm_medium=website&utm_campaign=a_zcoursetuf

rce=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article

&envId=sliding-window&
m_medium=article&itm_campaign=practice_card
forgeeks&itm_medium=article&itm_campaign=practice_card

ks&itm_medium=article&itm_campaign=practice_card
eeks&itm_medium=article&itm_campaign=practice_card
eeks&itm_medium=article&itm_campaign=practice_card
s&itm_medium=article&itm_campaign=practice_card

orgeeks&itm_medium=article&itm_campaign=practice_card
forgeeks&itm_medium=article&itm_campaign=practice_card
s&itm_medium=article&itm_campaign=practice_card

ksforgeeks&itm_medium=article&itm_campaign=practice_card
orgeeks&itm_medium=article&itm_campaign=practice_card
eeksforgeeks&itm_medium=article&itm_campaign=practice_card
geeksforgeeks&itm_medium=article&itm_campaign=practice_card
medium=article&itm_campaign=practice_card

sforgeeks&itm_medium=article&itm_campaign=practice_card

eks&itm_medium=article&itm_campaign=practice_card
medium=article&itm_campaign=practice_card
&itm_medium=article&itm_campaign=practice_card
edium=article&itm_campaign=practice_card
_medium=article&itm_campaign=practice_card
m_medium=article&itm_campaign=practice_card

m_medium=article&itm_campaign=practice_card

ksforgeeks&itm_medium=article&itm_campaign=practice_card
&itm_medium=article&itm_campaign=practice_card
tm_medium=article&itm_campaign=practice_card

m_medium=article&itm_campaign=practice_card
orgeeks&itm_medium=article&itm_campaign=practice_card
ks&itm_medium=article&itm_campaign=practice_card

orgeeks&itm_medium=article&itm_campaign=practice_card
eksforgeeks&itm_medium=article&itm_campaign=practice_card

dium=article&itm_campaign=practice_card

sforgeeks&itm_medium=article&itm_campaign=practice_card
_source=geeksforgeeks&itm_medium=article&itm_campaign=practice_card
ksforgeeks&itm_medium=article&itm_campaign=practice_card

recommendation&utm_medium=email&utm_source=7-day-campaign

You might also like