Skip to main content

Posts

Featured Post

Run Length Encoding | Programming In Java

  Given a string, Your task is to complete the function   encode   that returns the   run-length encoded  string for the given string. eg  if the input string is “wwwwaaadexxxxxx”, then the function should return “w4a3d1e1x6″. You are required to complete the function  encode  that takes only one argument the string which is to be encoded and returns the encoded string. Example 1: Input: str = aaaabbbccc Output: a4b3c3 Explanation: a repeated 4 times consecutively b 3 times, c also 3 times. Example 2: Input: str = abbbcdddd Output: a1b3c1d4 Your Task: Complete the function  encode()  which takes a character array as an input parameter and returns the encoded string. Expected Time Complexity:  O(N), N = length of a given string. Expected Auxiliary Space:  O(1) Constraints: 1<=length of str<=100 Solution: import java.util.*;   class RLEncoding {    public static void main(String[] args)     {         Scanner sc = new Scanner(System.in);        int T = sc.nextInt();   sc.nextLi
Recent posts

Basic Graph Data Structure Initialization Using Java Programming.

 Graph                         (4) -------------(3)                    /                                   \                 /                                         \           (5)------------(1)-----------(2) in This Above graph 4 connected to 3 and 5. Then 3 connected to 2 and 4 and so on. Graph are Used To Various Algorithms and Technology for example, Shortest Path Algorithm.               1.Graph.               2.bidirectional Graph.                3.Weighted Graph. Bidirectional  Graph               We Can Travel Both Side . Like Two Way Road. S======>E   and E<=====S (start to end and end to start) vice versa. Weighted Graph               Weighted Graph Have Length Of Path. Like Km Is Roadways. Properties vertex edge Vertex is a defined as start or end point. Edge is a connection between start and end points     import java.util.*; class graph< T >{ HashMap < T , LinkedList < T >> g= new HashMap < T , LinkedList < T >>(); publ

Symentic Matrix Using Python

What is  Symmetric  Matrix? A=[1 2]       [2 1] is a Square Matrix . When We Modify The Given Matrix Row Into Column And Column Into Row. if Modified and Original Matrix Array Are Same It Known As Symmetric Matrix. If A=A'     A=[1 2]                              A'=[1 2]            [2 1]   is Equal To       [2  1] Other Wise Given Matrix is Non Symmetric. The Follow Simple Python Code For Find The Given Array Is Symmetric or Not. arr=[[1,2],[2,1]] n=len(arr[0]) m=len(arr) isTrue=1 for i in range(0,n):     for j in range(0,m):         if(arr[i][j]!=arr[j][i]):             isTrue=0             break; print(isTrue)  output: 1 Time Complexity o(n^2). Comment Your solutions.

Sum Of Given Array Elements

public static void main( String [] args){ int [] arr={ 1 , 2 , 3 , 4 , 5 , 6 }; int n=arr.length; int sum= 0 ; for ( int i= 0 ;i<n;i++){ sum+=arr[i]; } System.out.println(sum); } } Java Programming /* Sum Of Given Array Elements Time Complexity O(n) */   class sumOfArray{

Array Reverse Using Java

In this article we are discuss about Basic Problem in Programming. How To Reverse a Array Elements. Reverse a given array elements. For example1, [1,2,3,4,5] Output [5,4,3,2,1] example2, Input [3,5,1,2,4] Output [4,2,1,5,3] 1) With Extra Space (Copy Arrar)  We can simple make a same size of array and copy from given array elements to new array variable. Its takes o(n) Time Complexity. And more Space To Run Programme. class arrayReverse{ public static void main( String [] args){ int [] arr={ 1 , 2 , 3 , 4 , 5 }; int n=arr.length; int [] brr= new int [n]; for ( int i= 0 ;i<n;i++){ brr[i]=arr[n-i- 1 ]; } for ( int j= 0 ;j<n;j++){ System.out.println(brr[j]); } } } 2)With Out Extra Space. We can Swap The Array Element One By One. Like First Element And Last. Second Element And Second Last Until Reach Middle Element. class arrayReverseWithoutExtraSpace{ public static void main( Strin

Remove array Dublicate With NoExtraSpace Using Java

  Find and remove Array Elements Which Appear More Then Once.(Remove Duplicate Elements From Sorted Array). For Example1, Input, [4,4,3,3,1] Output, [4,3,1] For Example2, Input, [5,5,4,3,1] Output, [5,4,3,1] Solution 1)Iterate the array elements. 2)Intalize The Index Counter(j). 3)Check If The Current And Next Element Are Same(i not equals i+1). 4)If Its Not Equal Store arr[i] into jth index. 5)do Until Itrate Whole Array Elements. How to find number of Array Elements Without Dublicate Array Elements. J+1 Elements Non Dublicate Array  Elements. Java class arrayDublicateWithNoExtraSpace{ public static void main( String [] args){ int [] arr={ 1 , 2 , 2 , 3 , 4 , 5 , 5 , 6 , 6 , 6 , 7 }; int n=arr.length; int j= 0 ; for ( int i= 0 ;i<n- 1 ;i++){ if (arr[i]!=arr[i+ 1 ]){ arr[j]=arr[i]; j+= 1 ; } } //Buffer Last Element Of Given Array if (arr[n- 1 ]!=arr[n