• 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

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are sequences of contiguous characters separated by any of
the characters that are part of delimiters

Example

/* strtok example */


int main ()
{
  char str[] ="This-is Go,Hired Site.";
  char * pch;
  printf ("Splitting string "%s" into tokens:n",str);
  printf ("--------");
  pch = strtok (str," ,.-"); // ',' '.' and '-' will be removed
  while (pch != NULL)
  {
    printf ("%sn",pch);
    pch = strtok (NULL, " ,.-");
  }
  return 0;
}
Output:
Splitting string “This-is Go,Hired Site.” into tokens:
——–
This is Go Hired Site

Similar Articles

Filed Under: problem Tagged With: Array, string

Reader Interactions

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

VMWare SDEII Interview

Number of Islands BFS/DFS

Length of the longest substring without repeating characters

Doubly linked list

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Max Sum in circularly situated Values

BFS (Breath First Search)

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

BlueStone E-commerce Interview Experience

SAP Off Campus Hiring_ March 2015 Sample Questions

Apriori algorithm C Code Data Mining

Minimum insertions to form a palindrome

ADOBE Aptitude C Language Test

Leetcode: Edit Distance

Regular Expression Matching

Practo Hiring Experience

Printing each word reverse in string

Adobe Interview Questions 8 month Exp

Maximum sum contiguous subarray of an Array

Find the smallest window in a string containing all characters of another string

Urban Ladder Written Test.

Generate largest number arranging a no. of given non negative integer numbers

simple sql injection

Templates in C++

Print vertical sum of all the axis in the given binary tree

Client Server C program

Common Ancestor in a Binary Tree or Binary Search Tree

Trapping Rain Water

LeetCode: Binary Tree Maximum Path Sum

Copyright © 2026 · Genesis Framework · WordPress · Log in