Coding-Interview-Prep

Binary Array Sorting-

Input: 
     5
     1 0 1 1 0
     
Output:
     0 0 1 1 1

Sum of numbers in string
```
Input:
   str = abc12yu8it4
   
Output: 24
```
Explanation: 1 and 23 are numbers in the string which is added to get the sum as 24.

check for sum of pair in array

arr[] = {1, -2, 1, 0, 5}

sum = 0

Input: 1 -2 1 0 5
       0
   
Output: Array doesnt have two elements with the given sum     Explaination:(No valid pair exists.)

Sum of all nodes present in binary tree

Print the index values of pair which meets the target

i/p- array:  [3,4,11,7]
  
     target:   7
 
     o/p-  0 1    (3+4=7)

Merge array

  input:  arr1= [1 3 5 7]
  
          arr2= [0 2 6 8 9]
  
 output:  [0 1 2 3 5 6 7 8 9 ]

Reverse an array

  Input: 2
         4
         7 3 4 6
  Output: 6 4 3 7

Reversing string without affecting the special characters
```
 Input: a?nm@6
 Output: 6?mn@a
```

Rotate a Linked List

 Input:
        N = 5
        value= 2 4 7 8 9
        k = 3
 Output: 8 9 2 4 7

Sum of array

Input:3
       4
       8
       9
Output:
       21

check string is a Palindrome or not
```
Input: mama
Output: not a palindrome
```

Bubble sort (optimal solution)

 Input: 89 40 21 42  10  60
 output: 10 21 20 40 42 60 89

printing the no's in same line without space
```
 Input: 5
 Output: 12345
```
Print all the substring which are palindrome within a given string
```
Input: clariebobgmama
Output: bob
        mama
```

Counting no of pairs

 Input: 5
       10 20 50 20 10
 output: 2

Book problem

  Input: 6 
         3
  Output: 1
  explaination:  [ |1] [2|3] [4|5] [6|]
                 if started from 1 then it will take only 1 move to reach to 3
                 if started from 6 then it will take 2 moves to reach 3
                 so, minimum moves required are 1 (started from 1)

Cats and a mouse

x: Cat A's position
y: Cat B's position
z: Mouse C's position
Input :
             2
             1 2 5
             1 3 2
Output:   Cat B
          Mouse C
explaination: The positions of the cats and mouse are shown below:
              A--B--C
              1  2  5
             Cat B  will catch the mouse first, so we print Cat B on a new line.

Height of binary tree

      input=   10
               /\
             20   11
             /\    \
            8  1    3
       output: 3

No of paths in matrix

      Input: 3 3
      output: 6
      explaination: 3*3 matrix
                    A B C
                    D E F
                    G H I
                    The possible paths which exists to reach 'I' from 'A' following above conditions are as follows:ABCFI, ABEHI, ADGHI, ADEFI, ADEHI, ABEFI

Piggy Bank Problem

     Ramu has opened his piggy bank to but some gift. There are different values of currencies present in the piggy bank. Ramu wants to make sure that he is have minimum change while purchasing the gift. Print the lowest amount that wont be possible with the coins present.
     Input: 3
            1 2 5
     Output: 4
     explaination: all possible values with given coins are: 1, 2, 3 (1+2), 5, 6 (1+6), 7 (2+5), 8 (1+2+5).  so, here 4 is the output

removing vowel from string:

     Input: geeksforgeeks
     Output: gksfrgks

Left view Binary tree

      Input:   10
               /\
             12  15
             /\    \
            7  11   5
                     \
                      3
      Output: 10 12 7 3

Check if a number is power of another number

      Input:
             X = 2, Y = 8
      Output:  1

Plateform problem Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept waiting. At any given instance of time, same platform can not be used for both departure of a train and arrival of another train. In such cases, we need different platforms,Arrival and departure time can never be the same for a train but we can have arrival time of one train equal to departure time of the other.
```
       Input: arr[] = {0900, 0940, 0950, 1100, 1500, 1800}
              dep[] = {0910, 1200, 1120, 1130, 1900, 2000}
       Output:  3
```

removing special characters

      Input: I kn@W th3 rig#t t#i^g !
      Output: I knw th rigt tig

reverse string without using inbuilt function

       Input: Hello, how are you
       Output: uoy era woh ,olleH

Sliding window protocol

      Input: 2,5,6,11,7,2,3,9              k=3
      Output: 24

Given two arrays as argument of method, your method should return true if one is subset of another, otherwise false.
```
      Input: [12,10,9,76,29,30]
             [12,9,30,21]
      Output: False
```

Rotate a matrix by 90'

      Input: 1 2 3 
             4 5 6
             7 8 9
      Output: 7 4 1 
              8 5 2
              9 6 3

validate an IP address

      Input: 175.81.35.09
      Output: Invalid

Kth smallest element

      Input: value for k: 4
             list size: 8
             enter elements: 23 5 18 31 4 43 2 11
      Output: kth smallest no is 11

To validate if string is binary or not

     Input:  1010100         1562544       ss8980
     Output: valid           Invalid       Invalid

Number guessing game

      ===welcome to Guessing game===
      Enter Lower bound: 6
      Enter Upper bound: 90

   You've only  6  chances to guess the integer!

      Guess a number:- 45
      You guessed too small!
      Guess a number:- 35
      You guessed too small!
      Guess a number:- 3
      You guessed too small!
      Guess a number:- 43

   Congratulations you did it in 3 tries.

sushmita2609 / coding-prep Goto Github PK

coding-prep's Introduction

Coding-Interview-Prep

coding-prep's People

Contributors

Stargazers

Watchers

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent