Scribd Logo
Upload

Welcome to Scribd!

  • Array Questions

    Uploaded by

    praveen pandey
    6 views18 pages
    1. The document discusses sorting and manipulating array elements. It describes swapping elements, finding duplicates, and calculating sums of pairs in an array. 2. Algorithms presented include sorting an array, finding duplicates by checking if an element appears more than once, and calculating the sum of all pairs in an array. 3. The document also mentions topics like dynamic arrays, intersections of arrays, and two pointer techniques.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document discusses sorting and manipulating array elements. It describes swapping elements, finding duplicates, and calculating sums of pairs in an array. 2. Algorithms presented include sorting an array, finding duplicates by checking if an element appears more than once, and calculating the sum of all pairs in an array. 3. The document also mentions topics like dynamic arrays, intersections of arrays, and two pointer techniques.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views18 pages

    Array Questions

    Uploaded by

    praveen pandey
    1. The document discusses sorting and manipulating array elements. It describes swapping elements, finding duplicates, and calculating sums of pairs in an array. 2. Algorithms presented include sorting an array, finding duplicates by checking if an element appears more than once, and calculating the sum of all pairs in an array. 3. The document also mentions topics like dynamic arrays, intersections of arrays, and two pointer techniques.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 18

    Arraytoobems

    ① Swap alternate

    ilp → ants]={ IFI.IT?8,-s}


    Yp →
    { 2,1 ,
    47,53

    [iIiñi
    ans→{2,1,4,3,6,5
    t.EE?EEF:#F:o > s y
    £
    ¥7
    "

    heap out

    A.¥o

    {uy(an[i, a•[i
    : -

    ind¥→ 5)
    (
    iit+&=i↳
    for 0 -

    { )
    if Liz
    < size

    3
    ✗

    ÉTUI -
    -
    ---

    3 4 5 6 7-

    11¥ i=0•-
    ¥☒ Ee
    .

    size-7
    enrrlyth
    [ < size ↳
    s
    → lies inside
    = array

    i=e+iX
    ?⃝
    →aJo]=T
    µ, [ 0) ;
    arr [D= arr

    -¥
    ÷÷""%
    am [☐ = am [ ]
    o

    →¥*-☒
    ¥ :÷÷
    an
    [ D= an
    [ 0]
    →n→og
    →

    ¥twTd
    ¥

    t€¥ →L]
    m =3

    fina
    →

    "

    -3--20
    =

    1/0+14-40 -10¥
    =D

    ×¥¥|i÷ ÷ =⑨
    I 3- 1- 6 3- 6-2

    *¥ ¥#
    0^0^0 # ⑧ → doit

    → feet code →

    Uniquenoofoccurence
    { 1- , 3,2 , ↳ 1+3%33

    -3£ }_ui@
    '
    Is
    3-7*2-1, not union

    fetus
    →

    no

    !É}-
    solution
    www..im
    finddup-li-atesll.lt#- - -n.o
    ②

    ⑤ 1
    ,
    N -

    ☐ ( atleast once
    )

    #É③t¥
    N=5

    [I s 1) [ 1,4]
    ¥1
    →
    -

    ,
    ,

    ② → I
    [1,N
    [ÉE*

    |
    Solution
    →"""""É
    , wut

    MET

    →!¥¥¥I÷
    •

    Vector
    →
    dynamic
    I
    o^x→④
    -
    ([

    n.IT/ehmtorepedm.#:- -: -: - - -Eo&- - - N-
    1 ,

    Leet Lode →
    findaddnptioksinahavaf
    L
    Homework
    → Intersection → Common donut

    ↳ Not present
    ↳ ÷÷÷
    Ty^① 3→②
    { 1,2 is }
    {

    ?-÷¥:?☒÷
    i check knhi Kone
    aage

    chce_k-T@aagebadhjveheupdet
    '
    aye-kesie[qosnometEt.E①
    ↳
    point

    break/
    again
    -

    ÷
    ¥→↳
    0
    2 2

    2%220 #

    :¥TF; ERA
    am [ i] < am
    Cj]
    -
    b

    amE)=j•
    piH"→
    i
    ¥ , g-
    + 1-
    ?⃝
    5
    Pair sun

    i É
    →

    → %

    s 5s
    -
    ,

    7
    → sum
    pair

    ¥_→
    ⇐¥÷€¥¥¥•D no → no

    4
    n
    - '

    e- → 0 →

    g
    i

    rÉ-
    FI
    ⇐ ME
    ÷÷÷¥
    as Is
    NÉ
    k
    ,-¥→§tu→→

    u*÷÷÷÷
    for (⑤ → n -
    1)

    ↳
    I tool +i - n -

    l ←
    A¥¥ J
    as
    one
    i K
    j

    ::÷☐•
    '

    -
    L-sripe-i-1.io
    left
    sorto.IO
    -7 ,

    -
    oh

    r.EE/: ; Tsavrrn1ong@
    5ohtin-yg.my
    Two
    & pointer
    -

    "*

    0-13 h h
    ↳

    ④
    OH zAw@
    ?⃝
    t.it#i-i i i *r-iripti---FF-Jj--
    •→ *

    e¥#!"¥_
    am.IE#daycjJ------&
    .→÷ itti

    i•→ toopnokdena_
    It
    E- d-
    É
    Jj jx
    o-E.to#-H=-
    L i. ↳

    %
    ilp
    → if
    rÉD
    ⇐
    Do@→Hwo①

    You might also like