Never cease to pursue knowledge
Never cease to pursue knowledge
Start learning today with our wide range of courses taught by industry experts. Gain new skills, advance your career, or explore new interests.
Browse Coursesimport java.util.*; class Maindsa { public static void main(String args[]) { LinkedList<String> list=new LinkedList<>(); //Add the elements to the list list.add(“apple”); //add elements to the list list.addFirst(“banana”); //add node to the front list.addLast(“cherry”); //add node at the end System.out.println(“Adding elements=” +list); list.remove();//removes the first element(banana) System.out.println(“After remove method=” +list); […]
Insert the node at middle(value,position) public void insertAtposition(int pos, int val)//pos=2, val=52 { Node newNode=new Node(val); Node temp=head; for(int i=1; i<pos; i++)i=2;2<2 { temp =temp.next; } newNode.next=temp.next; temp.next=newNode; }
import java.io.*; import java.util.*; class Node { int data; Node next; Node(int d)//50 { data=d;//data=50 next=null; } } class LinkedList { public static void main(String args[]) { Node head=null; Scanner s=new Scanner(System.in); Node current=null; for(int i=1;i<=5;i++)i=5<=5 { System.out.println(“Enter the elements=”);//50 int a=s.nextInt();//a=50 Node n=new Node(a);//create a node inside […]
class Customizedstack { private int arr[];//Array to store stack elements private int top; //acts as a cursor for stack private int capacity;//maximum size of stack Customizedstack(int size)//5 { capacity=size;//5 arr=new int[capacity];//0-4 top=-1; } public void push(int value)//10 { if(top==capacity-1)//4 { System.out.println(“stack is overflow”); } else { arr[++top]=value; } } public int […]
/*Question 2ú : Reverse Prefix of Word(Using Stack) Given a 0-indexed string word and a character ch, reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inclusive). If the character ch does not exist in word, do nothing.ä For example, […]
Customized stack { private int arr[];//Array to store stack elements private int top; //acts as a cursor for stack private int capacity;//maximum size of stack //1.constructor to initialize stack public Customized stack(int size)//size=5 { arr=new int[size]; capacity=size;//capacity=5 top=-1; } //2.method for push operation(inserting data) public void push(int data)//data=20 { if(isFull()) { System.out.println(“stack is full […]
Stack: A stack is a linear data structure that follows LIFO(LAST IN FIRST OUT) principle linear data structure–>where elements are arranged in a sequence order. Every elements will be connected to its previous or next element Task Description push(item)———————-Adds an item to the top of the stack pop()—————————Remove and return […]
A company is validating usernames for its internal employee portal Every employee enters their full name as a string like “john_123” your job is to write a program that does the following: 1. Accept a string that represents a username 2. Check if the username (i) contains only lowercase letters, digits […]
1)Reverse each word in a sentence input: java is fun output:avaj si nuf import java.util.*; class ASC { public static void main(String args[]) { String a=”java is fun”; String b[]=a.split(” “);//b[java–>0 is–>1 fun–>2] for(String c:b)//c=fun { StringBuilder s=new StringBuilder(c);//(fun) System.out.print(s.reverse()+” “);//avaj si nuf } } } ———————————– […]
Missing Attendance roll number: Given roll numbers from 1 to N,one is missing. Find the missing number int rolls[]={1,2,3,5} output: Missing number=4 —————————————————————————— 2)Find Duplicate ID: In an employee array, one ID is duplicated. Find that duplicate int empIDs={101, 103, 104, 101, 105} output: Duplicate: 101 class DuplicateID { […]
Learn the fundamentals of programming with Python in this beginner-friendly course.
Master the basics of data analysis, visualization, and machine learning.
Build modern websites with HTML, CSS, JavaScript and popular frameworks.
Learn SEO, social media marketing, email campaigns and analytics.