Skip to main content

About Us

 

Welcome to https://dsajavacpp.blogspot.com/, your number one source for all things Basic Programming Tutorials. We're dedicated to giving you the very best of Data structures and Algorithms , with a focus on Data Structures, Algorithms, Problem Solving.


Founded in 2020 by sathiskar, https://dsajavacpp.blogspot.com/ has come a long way from its beginnings in blogger. When sathiskar first started out, his passion for Friendly Programmings and Understands drove them to [action: quit day job, do tons of research, etc.] so that dsajavacpp.blogspot.com can offer you Through World Is Tiny Blogger. We now serve customers all over the world, and are thrilled that we're able to turn our passion into my own website.


I hope you enjoy my products as much as I enjoy offering them to you. If you have any questions or comments, please don't hesitate to contact me.


Sincerely,

Sathiskar Gokulakrishnan


Comments

Post a Comment

Popular posts from this blog

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name {        //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method
Post a Comment
Read more

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...
1 comment
Read more