{"id":1126,"date":"2015-04-22T17:39:00","date_gmt":"2015-04-22T17:39:00","guid":{"rendered":"http:\/\/www.guvi.in\/blogs\/?p=1126"},"modified":"2023-10-05T11:31:07","modified_gmt":"2023-10-05T06:01:07","slug":"frequently-appeared-interview-questions-for-software-development-engineertest","status":"publish","type":"post","link":"https:\/\/guviv3.codingpuppet.com\/blog\/frequently-appeared-interview-questions-for-software-development-engineertest\/","title":{"rendered":"100+ SDE & SDET Interview Questions With Answers"},"content":{"rendered":"\n

SDE\/SDET Interview questions that will ramp up your interview preparation<\/strong><\/p>\n\n\n\n

Myself, Balaji Boggaram Ramanarayan – I bag experience in taking\/preparing for interviews in several big companies and always felt sharing a few of them such that it might be useful for you in interview preparation.<\/p>\n\n\n\n

Note: These questions might help you ramp up your speed in the path of preparing for SDE \/SDET interviews in most techie companies. <\/em><\/p>\n\n\n\n

\u00a0SDE – Software Development Engineer<\/strong>
\u00a0SDET – Software Development Engineer in Test\u00a0<\/strong><\/p>\n\n\n\n\n\n

The must-know SDE\/SDET Interview Questions<\/strong><\/h2>\n\n\n
\n
\"\"<\/figure><\/div>\n\n\n

<\/p>\n\n\n\n

    \n
  1. Heap – Max Heaps and Min Heaps<\/li>\n\n\n\n
  2. Conversions: Decimal, Binary, Hex, Octal (All other possible combinations)<\/li>\n\n\n\n
  3. 90 Degrees Matrix conversion<\/li>\n\n\n\n
  4. Quick Sort + Applications<\/li>\n\n\n\n
  5. Merge Sort + Applications<\/li>\n\n\n\n
  6. Remove duplicates in a String — In place<\/li>\n\n\n\n
  7. Reverse a string – Inplace<\/li>\n\n\n\n
  8. Decide if 2 strings are anagrams or not?<\/li>\n\n\n\n
  9. Binary Search<\/li>\n\n\n\n
  10. Reverse SLL without using any extra nodes<\/li>\n\n\n\n
  11. Maximum Subarray [Kadane Algorithm]<\/li>\n\n\n\n
  12. Find an element that is repeated more than n\/2 times in a given set\/array. [Moores Voting algorithm]<\/li>\n\n\n\n
  13. Find an element in rotated Binary sorted array<\/li>\n\n\n\n
  14. Implement power function without pow() function<\/li>\n\n\n\n
  15.  Verify if the given linked list is circular\/cyclic or Acyclic. Follow up can be to indicate the starting point of the cycle<\/li>\n\n\n\n
  16. Implement Blocking queue<\/li>\n\n\n\n
  17. Find a pair in an array that will sum up to a particular number<\/li>\n\n\n\n
  18. Reverse a double linked list<\/li>\n\n\n\n
  19. Reverse pairs in SLL. i.e I\/P : a->b->c->d->e->f O\/p : b->a->d->c->f->e<\/li>\n\n\n\n
  20. Segregate even and odd nodes in a given linked list<\/li>\n\n\n\n
  21. Addition of 2 linked lists to separate one. (also learn inplace)<\/li>\n\n\n\n
  22. Convert SLL into DLL (XOR based linked lists)<\/li>\n\n\n\n
  23. Circular shift an array of integer input array by ‘k’ number of elements<\/li>\n\n\n\n
  24. Search for a given pattern in the text [Rabin Karp Algorithm]<\/li>\n\n\n\n
  25. atio() and itoa() implementations (ASCII to integer and Integer to ASCII)<\/li>\n\n\n\n
  26.  Binary Semaphores<\/li>\n\n\n\n
  27. Generate subsets of a given set of integers<\/li>\n\n\n\n
  28. Generate all permutations of a given string<\/li>\n\n\n\n
  29. Level order Traversal<\/li>\n\n\n\n
  30. The inorder successor of a given node in BST (Binary Search Tree)<\/li>\n<\/ol>\n\n\n\n

    SDE\/SDET Interview Questions- you should be able to answer<\/strong><\/h2>\n\n\n
    \n
    \"\"<\/figure><\/div>\n\n\n
      \n
    1. Find ‘k’ largest \/smallest elements in a given array (Hint: can use heaps)<\/li>\n\n\n\n
    2. Heap Sort + applications<\/li>\n\n\n\n
    3. Find minimum length unsorted subarray on which storing them makes a complete sorted array<\/li>\n\n\n\n
    4. Search if a given pattern exists in input text using Suffix Arrays<\/li>\n\n\n\n
    5. Re-arrange a string so that all same characters are ‘d’ distant apart<\/li>\n\n\n\n
    6. Knights tour problem<\/li>\n\n\n\n
    7. Rat in Maze [Back tracking]<\/li>\n\n\n\n
    8. Find out if two rectangles overlap or not<\/li>\n\n\n\n
    9. Where are the closest pair of points in the given plane<\/li>\n\n\n\n
    10. Find all subset of elements in the given set whose sum equals to a given target<\/li>\n\n\n\n
    11. Compute x^y such that it can work for floats and negative values<\/li>\n\n\n\n
    12. Find median of  given two input sorted arrays<\/li>\n\n\n\n
    13. Find the total no of zeros in a given array of 1’s followed by 0’s<\/li>\n\n\n\n
    14. If there is any sub-array find the ones which sum up to zero<\/li>\n\n\n\n
    15. Count number of inversions in a given array<\/li>\n\n\n\n
    16. Find a minimum element in a rotated sorted array<\/li>\n\n\n\n
    17. Which is the fixed point in the given array<\/li>\n\n\n\n
    18. Find the maximum subarray sum [D&C]<\/li>\n\n\n\n
    19. Count # of occurrences of a number in the sorted array<\/li>\n\n\n\n
    20. Find the max and min element in a given array with a minimal number of comparisons<\/li>\n<\/ol>\n\n\n\n

      30+ Software Developer (SDE) \/ Software Developer In Test (SDET) Questions for you<\/strong><\/h2>\n\n\n\n
        \n
      1. Check if a number is multiple of 3 or not?<\/li>\n\n\n\n
      2. One line function to check if a number is the power of 2 or not?<\/li>\n\n\n\n
      3. Function to multiple a number by 7.<\/li>\n\n\n\n
      4. Which is the function to multiply two numbers without using * product operator<\/li>\n\n\n\n
      5. Function to write Fibonacci series in an iterative manner<\/li>\n\n\n\n
      6. Generate all prime numbers less than or equal to n [Sieve of Erastho..]<\/li>\n\n\n\n
      7. Given a number, Find the next biggest palindrome number<\/li>\n\n\n\n
      8. Implement logic for a fair coin from a biased coin<\/li>\n\n\n\n
      9.  Check if a number is divisible by 7 without mod operator<\/li>\n\n\n\n
      10. Find all the possible words from a phone keypad<\/li>\n\n\n\n
      11. Lexicographic sort of permutation of all words<\/li>\n\n\n\n
      12. Shuffle a given array\/deck of cards [Fisher Yates Algo]<\/li>\n\n\n\n
      13. Reservoir Sampling Algorithm<\/li>\n\n\n\n
      14. Select ‘k’ random elements from ‘n’ elements<\/li>\n\n\n\n
      15. Given a number ‘n’. generate a pascal triangle out of it.<\/li>\n\n\n\n
      16. Write an exponential precision function [Taylor series]<\/li>\n\n\n\n
      17. Generate all prime factors of a given number<\/li>\n\n\n\n
      18. Generate all possible combinations of ‘r’ elements in a given array of size ‘n’ [Probability Distribution Function]<\/li>\n\n\n\n
      19. Length of Longest common subsequence of a given sequence of numbers<\/li>\n\n\n\n
      20. Find minimum cost path in a given cost matrix<\/li>\n\n\n\n
      21. Total # of solutions in a coin change problem<\/li>\n\n\n\n
      22. Find binomial co-efficient<\/li>\n\n\n\n
      23. Knap-sack standard problem<\/li>\n\n\n\n
      24. Egg-Drop standard problem<\/li>\n\n\n\n
      25. Length of longest palindrome sequence<\/li>\n\n\n\n
      26. Palindrome Partitioning<\/li>\n\n\n\n
      27. Maximum Length of chained increasing pair<\/li>\n\n\n\n
      28. Find the middle of the given linked list<\/li>\n\n\n\n
      29. Check if a given Single linked list is a palindrome or not<\/li>\n\n\n\n
      30. Insert\/Delete\/Search in max heap<\/li>\n\n\n\n
      31. Implement sizeof() operator<\/li>\n\n\n\n
      32. Find successor of given BST<\/li>\n\n\n\n
      33. Locate all triangle triples in the given array<\/li>\n\n\n\n
      34. Find the lowest common ancestor of a given node<\/li>\n\n\n\n
      35. Return a single element by knocking out all other elements by ‘k’ [Josephus]<\/li>\n<\/ol>\n\n\n\n

        Find more Software Developer (SDE) \/ Software Developer In Test (SDET) Questions <\/strong><\/h2>\n\n\n\n
          \n
        1. Given a sorted skewed binary tree, Create a BST out of it.<\/li>\n\n\n\n
        2. Given an array with integers, Output all the elements which were repeated exactly twice<\/li>\n\n\n\n
        3. Maximum depth\/height\/diameter of a given tree<\/li>\n\n\n\n
        4. Serialize and Deserialize a given binary tree<\/li>\n\n\n\n
        5. Find a single repeated or non-repeated number in the conditional list. (XOR)<\/li>\n\n\n\n
        6. Implement “diff” in Linux<\/li>\n\n\n\n
        7. Program to count # of set bits in a given integer.<\/li>\n\n\n\n
        8. Convert BST to a doubly-linked list<\/li>\n\n\n\n
        9. Convert integer to String without.toString()<\/li>\n\n\n\n
        10. GCD of two numerals<\/li>\n\n\n\n
        11. Given an array in post-order traversal, check whether the given array is in BST or not<\/li>\n\n\n\n
        12. Reverse the words in a given English sentence<\/li>\n\n\n\n
        13. Get the median of a stream of large numbers<\/li>\n\n\n\n
        14. Print all the paths of a given Binary Tree from root to leaf<\/li>\n\n\n\n
        15. Modify array such that arr[i] == arr[arr[i]] Inplace<\/li>\n\n\n\n
        16. Find the missing number in a billion number list<\/li>\n\n\n\n
        17. Bitwise addition<\/li>\n<\/ol>\n\n\n\n

          <\/p>\n\n\n\n

          To know about GUVI’s ZEN Class<\/strong>, Click here!<\/a> <\/strong><\/p>\n\n\n\n

          ZEN Review: Your First & Final Step Towards Becoming A PRO Full Stack Developer<\/a>\u00a0<\/p>\n\n\n\n

          Like to know more? Fill out the form and submit it. We will get back to you at the earliest.<\/p>\n\n\n

          [contact-form][contact-field label=”Name” type=”name” required=”true” \/][contact-field label=”Email” type=”email” required=”true” \/][contact-field label=”Website” type=”url” \/][contact-field label=”Message” type=”textarea” \/][\/contact-form]<\/p>\n","protected":false},"excerpt":{"rendered":"

          SDE\/SDET Interview questions that will ramp up your interview preparation Myself, Balaji Boggaram Ramanarayan – I bag experience in taking\/preparing for interviews in several big companies and always felt sharing a few of them such that it might be useful for you in interview preparation. Note: These questions might help you ramp up your speed […]<\/p>\n","protected":false},"author":1,"featured_media":4699,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[13,719],"tags":[],"views":"2049","authorinfo":{"name":"admin","url":"https:\/\/guviv3.codingpuppet.com\/blog\/author\/admin\/"},"thumbnailURL":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-content\/uploads\/2015\/04\/SDE-SDET-Interview-Questions-300x246.png","jetpack_featured_media_url":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-content\/uploads\/2015\/04\/SDE-SDET-Interview-Questions.png","_links":{"self":[{"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/posts\/1126"}],"collection":[{"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/comments?post=1126"}],"version-history":[{"count":10,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/posts\/1126\/revisions"}],"predecessor-version":[{"id":27909,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/posts\/1126\/revisions\/27909"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/media\/4699"}],"wp:attachment":[{"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/media?parent=1126"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/categories?post=1126"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/guviv3.codingpuppet.com\/blog\/wp-json\/wp\/v2\/tags?post=1126"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}