Interview Preparation Kit

-

Interview Preparation Resources :

1. Data Structures and Algorithms

2. Programming Language

OOPs

C++

Java

3. Database Management Systems

4. Operating Systems

5. System Design

6. Aptitude 

6. Puzzle 

  • GFG

    • Comments

    Post a Comment

    Popular posts from this blog

    Dinosaurus_Island_Character_level_language_model

    -
    Image
    Dinosaurus_Island_Character_level_language_model_final_v3a Character level language model - Dinosaurus Island ¶ Welcome to Dinosaurus Island! 65 million years ago, dinosaurs existed, and in this assignment they are back. You are in charge of a special task. Leading biology researchers are creating new breeds of dinosaurs and bringing them to life on earth, and your job is to give names to these dinosaurs. If a dinosaur does not like its name, it might go berserk, so choose wisely! Luckily you have learned some deep learning and you will use it to save the day. Your assistant has collected a list of all the dinosaur names they could find, and compiled them into this dataset . (Feel free to take a look by clicking the previous link.) To create new dinosaur names, you will build a character level language model to generate new names. Your algorithm will learn the different name patterns, and randomly generate new names. Ho...
    Read more

    All Algorithms of Searching & Sorting in the Best & Easiest way.

    -
    SEARCHING  &  SORTING ALGORITHM Linear Search     for(start to end of array) { if (current_element equals to 5) { print (current_index); } }    Time Complexity: O(N) Space Complexity: O(1) Binary Search int binarySearch ( int low , int high , int key ) { while ( low <= high ) { int mid =( low + high )/ 2 ; if ( a [ mid ]< key ) { low = mid + 1 ; } else if ( a [ mid ]> key ) { high = mid - 1 ; } else { return mid ; } } return - 1 ; //key not found }     Time Complexity: O ( log 2 N )  Space Complexity: O(1) Bubble Sort void bubble_sort ( int A [ ], int n ) { int temp ; for ( int k = 0 ; k < n - 1 ; k ++) { // (n-k-1) is for ignoring comparisons of elements which have already been compared in earlier ite...
    Read more