• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Unix

C Program for TAIL command of UNIX

April 27, 2015 by Dhaval Dave

/*
* usage: myTail [-n] [<filename>] */

#include <stdio.h>
#include <stdlib.h>

#define MAX_LINE_LEN 1024
#define DEFAULT_N 10

int main(int argc, char *argv[]) {
char **tail;
int count = DEFAULT_N, n, i, headX = 0, tailX 
… Read More

Filed Under: Adobe Interview Questions, Interview Questions, problem Tagged With: c, Unix

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Serialise Deserialise N-ary Tree

Flipkart Set 1 On Campus with Answers

Python List

Best Java Book | Top Java Programming Book for Beginners

Sequence Finder Dynamic Programming

Trie Dictionary

The greedy coins game Dynamic Programming

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Maximum sum contiguous subarray of an Array

Flipkart SDET Interview Experience

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Edit Distance ( Dynamic Programming )

LeetCode: Container With Most Water

LeetCode : Word Search

Client Server C program

Subset Sum Problem Dynamic programming

Circular Linked List

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Find the kth number with prime factors 3, 5 and 7

Leetcode: Edit Distance

Stickler thief

Count number of ways to reach a given score in a game

Handle duplicates in Binary Search Tree

Generic Object Oriented Stack with Template

Leetcode: Merge Intervals

Closed Parentheses checker

Search element in a matrix with all rows and columns in sorted order

SAP Off Campus Hiring_ March 2015 Computer Skills

LeetCode: Binary Tree Maximum Path Sum

Copyright © 2026 · Genesis Framework · WordPress · Log in