Interview Questions වලට Support එකක් දෙමුද ?

Interview Questions වලට Support එකක් දෙ&#3512

  • support එකක් දෙනවා

    Votes: 133 85.3%
  • වෙලාවක් නැ

    Votes: 23 14.7%

  • Total voters
    156

Anonymous_Abstract

Well-known member
  • Aug 7, 2018
    6,036
    4,570
    113
    Messier 87
    A & B are two integer arrays. Put their values into new array and sort it. Write an algorithm to do so.


    package com.benz.demo;

    public class AlgoDemo {

    public void mergeArray(int[] arr,int[] brr)
    {
    int[] zrr = new int[(arr.length+brr.length)];

    int index=0;

    while(index<arr.length)
    {
    zrr[index]=arr[index];
    index++;
    }

    int index2=0;
    while(index2<brr.length)
    {
    zrr[index] = brr[index2];
    index2 +=1;
    index++;
    }
    zrr = sort(zrr);
    show(zrr);

    }
    public void show(int[] result)
    {
    for(int res : result)
    {
    System.out.print(res+"\t");
    }
    }
    public int[] sort(int[] A)//Selection Sort
    {

    for(int i=0;i<A.length;i++)
    {
    int min = i;
    for(int c=i+1;c<A.length;c++)
    {
    if(A[c]<A[min])
    {
    min=c;
    }
    }
    swap(i,min,A);
    }
    return A;
    }
    public void swap(int i,int c,int[] arr)
    {
    int temp;
    temp = arr[c];
    arr[c]=arr;
    arr=temp;
    }
    public static void main(String[] args) {
    AlgoDemo ad = new AlgoDemo();
    int[] A= {78,34,55,32,89,98};
    int[] B= {12,34,54,32,11};
    ad.mergeArray(A,B);

    }

    }
     
    • Love
    Reactions: saja

    saja

    Well-known member
  • Jan 8, 2007
    16,203
    2
    10,802
    113
    Home Sweet Home
    මේ දවස් වල IT interview යන්න set උන අය කව්ද ? skype/zoom වගේ remote conference call වලින්ද interview කරන්නේ ?
     

    Asiri88

    Active member
  • Mar 1, 2019
    504
    79
    28
    මේ දවස් වල IT interview යන්න set උන අය කව්ද ? skype/zoom වගේ remote conference call වලින්ද interview කරන්නේ ?

    Interview newe appointment dipu ewath cancel letter eka sign karala nathnam

    Interview nam nathima ma tharam
     
    • Like
    Reactions: saja

    saja

    Well-known member
  • Jan 8, 2007
    16,203
    2
    10,802
    113
    Home Sweet Home
    ජොබ් දාල තියෙන්නේ topjobs එකේ March 20 ඉදන් එතකොට . mee අදත් දාල :yes:

    Interview newe appointment dipu ewath cancel letter eka sign karala nathnam

    Interview nam nathima ma tharam
     
    Last edited:

    Djice

    Well-known member
  • Jan 17, 2011
    4,422
    3,801
    113
    out of fucked up land
    langadi cloud provider kenekge interview ekakata giya. mata okkoma interview 7k thibba. godakma ahuwe linux prashna
    - a software was deployed to a compute instance last week and it worked fine. It no longer works. you see a memory error. how would you debug this
    - what's LD_PRELOAD
    - `/tmp` in linux has the sticky bit on. why
    - question on how http works in terms of networking
    - scaling horizontally/vertically
    - system design question was on designing a monitoring system
    - some basic live coding for about 1.5hrs across 3 interviews

    Ironman wants to travel from Avengers tower to stark tower. on the way, he has to make stops and rest (he has fought extraterrestrials and is weak). on every stop there is either charging device for his suit or he needs to vanquish a stray alien consuming his power. charging devices increase the suit power and fighting the alien drains it. if any given time his power goes below 1 he dies. given an array of stop with values (positive mean charging places with capacity and negative being the power requires to kill the alien) calculate the minimum power capacity he needs to have before starting the journey in order to safely reach stark tower. write the pseudo code and explain.
    interesting question. I've seen quite a few like this. I guess you just need to check what's the minimum sum you can get to at any point in the array and calculate the number that will get that number to +1.
    Code:
    package main
    
    import "fmt"
    
    func main() {
        arr := []int{0, -10, 3, -1, 11, -3, -5}
        sum := 0
        power := 1
        for i := 0; i < len(arr); i++ {
            sum += arr[i]
            if sum < 0 {
                v := (0 - sum) + 1
                if v > power {
                    power = v
                }
            }
        }
        fmt.Println(power)
    }
    ------ Post added on Jan 14, 2025 at 1:51 PM
     
    Last edited:
    • Love
    Reactions: devops and saja

    Clockwork

    Well-known member
  • Mar 6, 2024
    9,442
    8,911
    113
    1st interview eka live pentest ekk :- selected but campus eken letter ek dunne na

    2nd interview company:- selected but soc

    3rd interview :- dan wada karanne eeke campus eke antilt thaga dala letter ek gtt