Crack Coding Rounds

       I am creating this page for beginners who haven't done coding in the academics. This might be due to the unfriendliness with Data Structures and Algorithms subject. But believe me many of you would not be able to land any offer if you do not even prepare bare minimum. You might ask what is bare minimum for landing a job with decent package. I would say, prepare following topics from DS and Algo:
       1. Array
       2. Linked List
       3. Stack
       4. Queue
       5. Searching and Sorting Algorithms
       6.  understand Time and Space complexity
       7. Hashmaps

  If you are in last year of Engineering this is high time you should get your hands dirty with coding. If you don't want to end up searching jobs after completing degree, you need to take control of things right now. Also, many of you may not want to go to Infosys, TCS, Cognizant or Wipro like service based companies. To land offer in product based companies it is very important to be prepared with basics of DS and Algorithms. Also prepare for aptitude as well. There are some very helpful channels on Youtube for learning those concepts for aptitude. Don't be lazy once this time is gone only regret remains with us and you feel like you have had enough time but just because of your lazy ass it got ruined.

       To make you feel confident I am going to put problems from some coding platforms like codechef, hackaerrank and leetcode along with solutions. Along with will also post some generic coding questions which are frequently asked in many interviews. You can learn them and try to solve similar problems from these platforms from beginner level/ easy section. I am very moody person I don't do blogging regularly, sorry for that but I'll keep posting stuff.


1. Sum of digits in the given number.
2. Obtain the sum of the first and last digits of this number.
3. Reverse a linked list. (using recursion)
4. Convert Decimal number to Binary. (Using recursion)
5. Find missing number from given range of 1 to n.
6. Find all pairs of an integer array whose sum is equal to a given number.


Comments

  1. Anonymous30 Mar 2022, 09:32:00

    This comment has been removed by a blog administrator.

    ReplyDelete

Post a Comment

Popular posts from this blog

Priority Scheduling Algorithm Java Program.

import java.util.Scanner; public class priority{ public static void main(String args[]) { Scanner s = new Scanner(System.in); int x,n,p[],pp[],bt[],w[],t[],awt,atat,i; p = new int[10]; pp = new int[10]; bt = new int[10]; w = new int[10]; t = new int[10]; //n is number of process //p is process //pp is process priority //bt is process burst time //w is wait time // t is turnaround time //awt is average waiting time //atat is average turnaround time System.out.print("Enter the number of process : "); n = s.nextInt(); System.out.print("\n\t Enter burst time : time priorities \n"); for(i=0;i<n;i++) { System.out.print("\nProcess["+(i+1)+"]:"); bt[i] = s.nextInt(); pp[i] = s.nextInt(); p[i]=i+1; } //sorting on the basis of priority for(i=0;i<n-1;i++) { for...
Read more

Implement UNIX system calls like ps, fork, join, exec family, and wait for process management (use shell script/ Java/ C programming).

//A small example to show how to use execvp() function in C. We will have two .C files , EXEC.c and execDemo.c and we will replace the execDemo.c with EXEC.c by calling execvp() function in execDemo.c . //EXEC.c  #include<stdio.h>  #include<unistd.h>  int main()   {        int i;       printf("This  is EXEC.c, called by execvp() ");        printf("\n");       return 0;   }  Now,create an executable file of EXEC.c using command  gcc EXEC.c -o EXEC //execDemo.c #include<stdio.h> #include<stdlib.h>  #include<unistd.h>  int main()  {     //A null terminated array of character      //pointers       char *args[]={"./EXEC",NULL};       execvp(args[0],args);     /*All statements are ignored after execvp() call as this whole process(execDemo.c) is replaced by ...
Read more

Implement a class CppArray which is identical to a one-dimensional C++ array (i.e., the index set is a set of consecutive integers starting at 0) except for the following : 1. It performs range checking. 2.It allows one to be assigned to another array through the use of assignment operator. 3.It supports a function that returns the size of the array.

#include<iostream> #include<math.h> using namespace std; class array {      int a[10],b[10],i,j,temp,n;           public:             void accept();             void display();             void range();             void sort();             void exchange();             int size(); }; void array::accept() {     cout<<"How many Elements you want to insert into the array=\n";     cin>>n;     cout<<"Enter the array Elements=\n";     for(i=0;i<n;i++)        {             cout<<...
Read more